Welcome to MSDN Blogs Sign in | Join | Help

Browse by Tags

All Tags » combinatorial optimization   (RSS)

Int'l Symposium on Mathematical Programming, Day 2

Posted Thursday, August 27, 2009 8:22 PM by Nathan Brixius
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...
0 Comments

Int'l Symposium on Mathematical Programming, Day 1

Posted Wednesday, August 26, 2009 6:35 AM by Nathan Brixius
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...
0 Comments

Quadratic Assignment Problems: solution enumeration

Posted Monday, July 27, 2009 9:53 AM by 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...
0 Comments

Quadratic Assignment Problems: strong and weak branching

Posted Sunday, July 19, 2009 7:19 PM by Nathan Brixius
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...
0 Comments

Quadratic assignment problems: branching

Posted Sunday, July 12, 2009 4:24 PM by Nathan Brixius
(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...
0 Comments

Solver Foundation TSP Part II: Directives, Solver Plugins, Model Libraries

Posted Thursday, May 07, 2009 8:47 PM by Nathan Brixius
Here is my as-promised "part 2" to my traveling salesman sample . My goal is not to try and do any "production level" modeling, but instead "point the way" by highlighting different aspects of Solver Foundation's architecture. This time I want to talk Read More...
1 Comments

Solving traveling salesman problems using Solver Foundation

Posted Monday, April 27, 2009 8:18 AM by Nathan Brixius
Here's an example that I walked through during yesterday's INFORMS session. Erwin has two blog postings about Solver Foundation and the traveling salesman problem, but I want to throw in my two cents because I want to emphasize a couple of points: By Read More...
2 Comments

Solver Foundation 1.2 released!

Posted Saturday, April 18, 2009 8:48 PM by Nathan Brixius
I am pleased to announce that Solver Foundation v1.2 is live on solverfoundation.com ! Our goal in 1.2 was to make a few key improvements to address feedback that we have received from partners and customers. If you have feedback, questions, suggestions…please Read More...
1 Comments

Resource constrained scheduling; OML tutorials

Posted Tuesday, March 31, 2009 7:43 PM by 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...
3 Comments

Simple matrix, vector, permutation utilities

Posted Tuesday, March 24, 2009 9:24 PM by Nathan Brixius
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...
1 Comments

Branch-and-bound algorithms for QAP

Posted Monday, March 23, 2009 1:22 PM by Nathan Brixius
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...
3 Comments

Microsoft Solver Foundation version 1.1 released

Posted Wednesday, February 18, 2009 7:34 AM by Nathan Brixius
Microsoft Solver Foundation version 1.1 has been released and the Express version can be downloaded for free here . 1.1 is a big deal because of the introduction of our solver plug-in model. This allows new or existing 3rd party solvers to interface with Read More...
4 Comments

Solver Foundation used to schedule Microsoft Tech Days '09

Posted Wednesday, January 21, 2009 7:57 PM by Nathan Brixius
Pascal Belaud of Microsoft France recently used Microsoft Solver Foundation to schedule the big Microsoft Tech Days '09 conference in sunny Paris, France. The conference has over 16,000 attendees, with hundreds of presentations involving hundreds of speakers Read More...
0 Comments

Announcing Microsoft Solver Foundation

Posted Friday, November 14, 2008 10:26 AM by Nathan Brixius
I'm pleased to announce the availability of the first version of Microsoft Solver Foundation ! Simply put, Solver Foundation is a set of modeling tools and solvers to help you make smart decisions when confronted with complex requirements and priorities. Read More...
3 Comments

Linear assignment problems, part III

Posted Thursday, August 09, 2007 10:14 AM by Nathan Brixius
Here's the code. See the previous posting for background. using System; namespace NathanBrixius.AssignmentLib { /// <summary>Linear assignment problem solver.<summary> /// <remarks> /// This code is a port of Fortran code by R.E. Burkard Read More...
2 Comments
More Posts Next page »
 
Page view tracker