Nathan Brixius

Two weeks back I posted two articles showing how easy it is to model critical path scheduling using Microsoft Solver Foundation . I received a few emails asking about various extensions; I will be covering those in upcoming posts. Julian just wrote a Read More...

I am going to be rolling out the rest of my branch-and-bound algorithm in the next few posts. To make that easier, in this post I introduce some common matrix, vector, and permutation methods. It turns out that for technical computing applications, C#'s Read More...

This is part 4 in a series of posts laying out a simple branch-and-bound solver for QAP in C#. Last time (several months ago!) I provided a simple bounding procedure for QAP. I want to take a step back and give the high-level algorithm, then in subsequent Read More...

Yesterday I introduced a simple OML model for computing project schedules. The model has the following sections: Parameters : input data that comes from Excel. Decisions : the values that I want to solve for. Constraints : the relationships that decisions Read More...

I'd like to work through a few examples of how to model real problems using Solver Foundation. If you download the Solver Foundation Express Edition , you can follow along: start Excel, click the Solver Foundation tab, then click on the Model button to Read More...