This is part 3 of what will be a long series about how to solve QAPs using branch-and-bound. My goal to end up with a simple branch-and-bound algorithm in C#. In my last post I wrote down the formulation for QAP, wrote a QAP class in C#, and showed how
Read More...
