A simple, all primal branch and bound approach to pure and mixed integer binary programs.
Gary A. KochenbergerVictor H. RichardPublished in: Oper. Res. Lett. (1982)
Keyphrases
- branch and bound
- mixed integer
- lagrangian heuristic
- optimal solution
- network design problem
- linear program
- branch and bound algorithm
- lower bound
- column generation
- search algorithm
- linear programming
- search space
- upper bound
- convex hull
- cutting plane
- feasible solution
- mixed integer programming
- lot sizing
- combinatorial optimization
- linear programming problems
- branch and bound procedure
- valid inequalities
- objective function
- tree search
- continuous variables
- metaheuristic
- np hard
- integer programming problems
- lagrangian dual
- special case