Sunday, September 20, 2009

[TECH] Border Length Minimization Solver

BLM (Border Length Minimization ) is a combinatorial optimization problem which belongs to the same class the QAP (Quadratic Assignment Problem). We now have a new result which indeed proves that BLM problem is NP-hard on any simple connected grid. We are developing a BLM solver which can give good results in practice. I'm now using Launchpad for all the development of this project. The latest commits can be kept track at .

No comments: