Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra.
Sung-Pil HongLevent TunçelPublished in: Discret. Appl. Math. (2008)
Keyphrases
- combinatorial optimization
- lower bound
- branch and bound algorithm
- branch and bound
- upper bound
- combinatorial optimization problems
- traveling salesman problem
- metaheuristic
- mathematical programming
- optimization problems
- combinatorial problems
- simulated annealing
- quadratic assignment problem
- higher order
- single machine scheduling problem
- optimal solution
- hard combinatorial optimization problems
- exact algorithms
- objective function
- column generation
- convex hull
- worst case
- special case
- polynomial approximation
- memetic algorithm
- lower and upper bounds
- max flow min cut