Algorithm for Border Length Minimization problem.

Registered 2009-09-17 by Vamsi Kundeti

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 NP-hard 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:
====
blm-solve <degree-of-hierarchy> <file-with-probes>

Project information

Maintainer:
Vamsi Kundeti
Driver:
Not yet selected
Development focus:

trunk series 

lp:blm-solve 
Browse the code

Programming Languages:
C, C++, Perl
Licences:
GNU LGPL v3
()

RDF metadata

View full history Series and milestones

BLM-Solve trunk series is the current focus of development

All bugs Latest bugs reported

Get Involved

  • Report a bug
  • warning
    Ask a question
  • warning
    Help translate

Downloads

Latest version is v0.9
released on 2009-09-20

All downloads

Announcements

  • RELEASE v0.9 on 2009-09-20
    Complete solver released for i686/i386 Linux