Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path.
Aris AnagnostopoulosFabrizio GrandoniStefano LeonardiAndreas WiesePublished in: IPCO (2013)
Keyphrases
- integrality gap
- valid inequalities
- arbitrarily close
- linear programming relaxation
- linear programming
- lp relaxation
- linear program
- integer programming
- traveling salesman problem
- mixed integer programming
- finite number
- optimal solution
- mixed integer
- primal dual
- feasible solution
- cutting plane
- lower and upper bounds
- lower bound
- integer programming formulation
- convex hull
- randomly generated problems
- integer program
- simulated annealing
- minimum cost
- approximation algorithms
- column generation
- knapsack problem
- message passing
- shortest path
- objective function
- lagrangian relaxation
- network flow
- branch and bound
- continuous variables