Exponential Lower Bounds for Polytopes in Combinatorial Optimization.
Samuel FioriniSerge MassarSebastian PokuttaHans Raj TiwaryRonald de WolfPublished in: J. ACM (2015)
Keyphrases
- combinatorial optimization
- lower bound
- branch and bound
- branch and bound algorithm
- quadratic assignment problem
- upper bound
- traveling salesman problem
- average case complexity
- metaheuristic
- combinatorial optimization problems
- simulated annealing
- combinatorial problems
- np hard
- mathematical programming
- optimization problems
- lower and upper bounds
- optimal solution
- hard combinatorial optimization problems
- convex hull
- valid inequalities
- objective function
- vc dimension
- graph theory
- lagrangian relaxation
- estimation of distribution algorithms
- neural network
- path relinking
- vehicle routing problem
- multi objective