An improved branch and bound algorithm for mixed integer nonlinear programs.
Brian BorchersJohn E. MitchellPublished in: Comput. Oper. Res. (1994)
Keyphrases
- branch and bound algorithm
- integer variables
- mixed integer
- optimal solution
- mixed integer linear programming
- branch and bound
- lower bound
- np hard
- network design problem
- upper bound
- linear program
- feasible solution
- quadratic program
- objective function
- combinatorial optimization
- convex hull
- mixed integer programming
- continuous variables
- cutting plane
- linear programming
- lot sizing
- max sat
- search algorithm
- knapsack problem
- integer programming
- lagrangian relaxation
- valid inequalities
- column generation
- probabilistic model
- search space