A Branch-and-Bound Algorithm for the Molecular Ordered Covering Problem.
Michael SouzaNilton MaiaRômulo S. MarquesCarlile LavorPublished in: J. Comput. Biol. (2024)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- lower bounding
- optimal solution
- test problems
- search tree
- np hard
- combinatorial optimization
- mixed integer linear programming
- upper bounding
- precedence constraints
- randomly generated problems
- variable ordering
- single machine scheduling problem
- integer variables
- maximum clique
- search algorithm
- lagrangian relaxation
- partially ordered
- branch and bound method
- lower and upper bounds
- particle swarm optimization
- search space
- computational complexity