An implicit branch-and-bound algorithm for mixed-integer-linear programming.
Youling LinLarry M. AustinJames R. BurnsPublished in: Comput. Oper. Res. (1990)
Keyphrases
- mixed integer linear programming
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- optimal solution
- lower bounding
- np hard
- search tree
- combinatorial optimization
- precedence constraints
- randomly generated problems
- upper bounding
- max sat
- computational complexity
- mixed integer nonlinear programming
- single machine scheduling problem
- genetic algorithm
- finding an optimal solution
- search algorithm
- constraint satisfaction