Nathan Brixius

In the last few posts we have given code for computing the Gilmore Lawler bound for quadratic assignment problems, and described two different branching techniques . In this post we show how to enumerate solutions of a small QAP. The possible solutions Read More...

Let's pick up where we left off last time and write a score-based Branch delegate. It will be used as the basis for both of our "real" branching functions. private BranchingDecision BranchCore( BranchAndBoundNode node, double bound, double [][] S) { RowColumnSums(S, Read More...

(This is part of a long-running series on quadratic assignment problems in C#. Click here to catch up. ) Branching means to divide the search space represented by a node into subnodes. QAP is about making assignments of facilities to locations, so two Read More...