Nathan Brixius

The latest edition of Scott Hanselman 's Hanselminutes podcast features yours truly. We talked about Solver Foundation, numerical optimization, and good old-fashioned code optimization. Scott's a great guy and doing the podcast was a lot of fun. Those Read More...

Here are my notes from the second day of ISMP . ( Here are my day 1 notes. ) I spent the whole day going to IPM talks: Meszaros : Unfortunately I missed the plenary talk by Friedrich Eisenbrand due to microbrews. I attended an IPM session after that - Read More...

I am attending the ISMP math programming conference in Chicago, representing the Solver Foundation team. Here are some of my impressions of Day 1 at ISMP: Plenary [Steven Boyd]: The plenary speaker was Steve Boyd who talked about real-time embedded convex Read More...

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...