BLMP (Border Length Minimization Problem ) 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 BLMP problem is NPhard on any simple connected grid. We also developed a BLMP solver which can which uses a hierarchical refinement approach to refine any heuristic solution to the BLMP problem. The BLMP finds applications in optimizing the Microarray manufacturing process.
A hierarchical algorithm for solving the Border Length Minimization (BLM) Problem. The program takes an input of $N$ probes and outputs a permutation and its cost using a hierarchal algorithm. BLM problem is a hard combinatorial problem, it finds applications in optimizing the Microarray manufacturing process.
This hierarchical algorithm for solving the BLM Problem takes an input of $N$ probes and outputs a permutation and its cost (originating from the hamming distance between two probes). BLM problem is a hard combinatorial problem, it finds applications in optimizing the Microarray manufacturing process.
USAGE:
====
blmsolve <degree
Project information
 Maintainer:
 Vamsi Kundeti
 Driver:
 Not yet selected
 Development focus:
 Programming Languages:
 C, C++, Perl
 Version control system:
 Bazaar
 Licences:
 GNU LGPL v3
View full history Series and milestones
BLMSolve trunk series is the current focus of development
All bugs Latest bugs reported

Bug #433401: Problem with function $SwapSubProblemSegments$
Reported on 20090920