A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs.
Brian BorchersJohn E. MitchellPublished in: Comput. Oper. Res. (1997)
Keyphrases
- network design problem
- benders decomposition
- approximation algorithms
- branch and bound
- mixed integer
- lagrangian heuristic
- np hard
- special case
- lower bound
- exact algorithms
- worst case
- quadratic program
- cutting plane
- upper bound
- branch and bound algorithm
- primal dual
- search algorithm
- branch and bound procedure
- combinatorial optimization
- linear program
- network design
- optimal solution
- minimum cost
- column generation
- convex hull
- valid inequalities
- genetic algorithm
- metaheuristic
- search space