rafathasan / branch-and-bound-search

Branch and bound (BB) is an algorithm design paradigm for discrete and combinatorial optimization problems, as well as mathematical optimization. A branch-and-bound algorithm consists of a systematic enumeration of candidate solutions by means of state space search.

Hi 👋, I'm Rafat Hasan

There is an easy way and a hard way. The hard part is finding the easy way.

• 🔭 I’m currently working toward higher study.

• 🌱 I’m currently learning to effectively collaborate in team.

• 👯 I’m looking to collaborate on Machine Learning, Computer Vision, Convolutional Models etc.

• 👨‍💻 All of my projects are available at https://github.com/rafathasan

• 📫 How to reach me [email protected]

• ⚡ Fun fact: There's a 50% chance that two people will share a birthday in a group of 23 people.

Connect with me:

Languages and Tools: