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