A column-generation based branch-and-bound algorithm for sorting by reversals.
Alberto CapraraGiuseppe LanciaSee-Kiong NgPublished in: Mathematical Support for Molecular Biology (1998)
Keyphrases
- column generation
- branch and bound algorithm
- branch and bound
- optimal solution
- lower bound
- search algorithm
- upper bound
- set covering problem
- combinatorial optimization
- lower bounding
- lagrangean relaxation
- exact solution
- search space
- integer linear programming
- vehicle routing
- cutting plane
- mixed integer programming
- integer program
- lagrangian relaxation
- single machine scheduling problem
- set partitioning
- upper bounding
- linear programming relaxation
- set covering
- linear programming
- max sat
- search strategies
- linear program
- np hard
- vehicle routing problem with time windows
- integer programming