Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality.
Dorit S. HochbaumNimrod MegiddoJoseph NaorArie TamirPublished in: Math. Program. (1993)
Keyphrases
- approximation algorithms
- tight bounds
- integer program
- upper bound
- np hard
- integer programming
- worst case
- linear program
- special case
- column generation
- lower bound
- vertex cover
- minimum cost
- cutting plane
- multistage stochastic
- network flow
- primal dual
- approximation ratio
- set cover
- network design problem
- optimal solution
- valid inequalities
- linear programming relaxation
- randomized algorithms
- polynomial time approximation
- open shop
- constant factor approximation
- soft constraints
- precedence constraints
- branch and bound algorithm
- np complete
- linear programming
- computational complexity
- binary variables
- constant factor
- undirected graph
- scheduling problem
- disjoint paths