A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming Problems.
Ronald E. DavisDavid A. KendrickMartin WeitzmanPublished in: Oper. Res. (1971)
Keyphrases
- branch and bound algorithm
- mixed integer programming problems
- lower bound
- branch and bound
- randomly generated
- np hard
- upper bound
- optimal solution
- lower bounding
- combinatorial optimization
- precedence constraints
- test problems
- randomly generated problems
- search tree
- mixed integer linear programming
- lagrangian relaxation
- single machine scheduling problem
- variable ordering
- branch and bound method
- finding an optimal solution
- upper bounding
- particle swarm optimization
- evolutionary algorithm
- integer variables
- scheduling problem
- max sat
- column generation
- search space
- dynamic programming