A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron.
Kurt M. BretthauerA. Victor CabotPublished in: Comput. Oper. Res. (1994)
Keyphrases
- branch and bound
- cutting plane algorithm
- column generation
- objective function
- cutting plane
- lower bound
- optimal solution
- branch and bound algorithm
- upper bound
- search algorithm
- branch and bound search
- search space
- combinatorial optimization
- lagrangian relaxation
- valid inequalities
- maximum margin
- integer program
- convex functions
- integer programming
- tree search
- linear programming
- vehicle routing problem with time windows
- optimization problems
- network design problem
- convex hull
- linear programming relaxation
- mixed integer programming
- np hard
- routing problem
- cost function
- max sat
- lower and upper bounds
- special case