Valid integer polytope (VIP) penalties for branch-and-bound enumeration.
Gerald G. BrownRobert F. DellMichael P. OlsonPublished in: Oper. Res. Lett. (2000)
Keyphrases
- branch and bound
- search space
- integer points
- lower bound
- search algorithm
- branch and bound algorithm
- extreme points
- optimal solution
- column generation
- upper bound
- combinatorial optimization
- branch and bound method
- convex hull
- beam search
- facet defining
- randomly generated problems
- tree search
- branch and bound procedure
- constraint satisfaction problems
- tree search algorithm
- depth first search
- network design problem
- branch and bound search
- search tree
- search strategy
- linear programming relaxation
- search strategies
- max sat
- metaheuristic
- special case
- genetic algorithm