Technical Note - An Improved Branch-and-Bound Method for Integer Programming.
John A. TomlinPublished in: Oper. Res. (1971)
Keyphrases
- integer programming
- branch and bound method
- mixed integer programming
- branch and bound
- np hard
- branch and bound algorithm
- production planning
- column generation
- lagrangian relaxation
- feasible solution
- lower bound
- linear programming
- reduce the search space
- optimal configuration
- optimal solution
- constraint programming
- network flow
- integer program
- cutting plane
- valid inequalities
- ai planning
- set covering problem
- cutting plane algorithm
- set covering
- np complete
- linear program
- inference problems
- upper bound
- knapsack problem
- search space
- objective function
- probabilistic model