Practical Approximation Algorithms for Separable Packing Linear Programs.
Feodor F. DraganAndrew B. KahngIon I. MandoiuSudhakar MudduAlexander ZelikovskyPublished in: WADS (2001)
Keyphrases
- approximation algorithms
- linear program
- np hard
- primal dual
- linear programming
- special case
- optimal solution
- minimum cost
- worst case
- semi infinite
- linear programming problems
- simplex method
- stochastic programming
- column generation
- interior point methods
- randomized algorithms
- quadratic program
- scheduling problem
- vertex cover
- extreme points
- set cover
- dynamic programming
- approximation ratio
- lower bound
- simplex algorithm
- mixed integer
- constant factor
- integer programming
- constant factor approximation
- disjoint paths
- computational complexity
- undirected graph
- objective function
- knapsack problem
- branch and bound algorithm
- valid inequalities
- packing problem