From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems.
Dimitris BertsimasChung-Piaw TeoPublished in: Oper. Res. (1998)
Keyphrases
- primal dual
- approximation algorithms
- valid inequalities
- exact algorithms
- network design problem
- randomly generated problems
- convex programming
- np hard
- linear programming
- special case
- interior point methods
- np hardness
- integer programming formulation
- worst case
- convex optimization
- cutting plane algorithm
- integrality gap
- minimum cost
- approximation ratio
- linear program
- convergence rate
- linear programming relaxation
- lp relaxation
- constant factor
- np complete
- mixed integer programming
- set cover
- quadratic program
- combinatorial auctions
- integer programming
- feasible solution
- multistage
- search algorithm