The F#.NET Journal just published an article about combinatorial optimization:
"Finding the global minima of an arbitrary function is a significantly more challenging problem than local function minimization and has many practical applications from the simulation of molecules to the design of printed circuit board layouts. Several different global function minimization algorithms exist. This article describes a simple and elegant solution to the traveling salesman problem that uses the simulated annealing approach to global function minimization. The results are visualized in real time using Windows Presentation Foundation. In particular, we show how the purely functional use of data structures facilitates an efficient lock-free way to obtain recent results for visualization..."
To read this article and more, subscribe to The F#.NET Journal today!