Approximation algorithms for covering/packing integer programs.
Stavros G. KolliopoulosNeal E. YoungPublished in: J. Comput. Syst. Sci. (2005)
Keyphrases
- approximation algorithms
- integer program
- np hard
- integer programming
- column generation
- linear program
- packing problem
- minimum cost
- special case
- multistage stochastic
- network flow
- cutting plane
- set cover
- vertex cover
- worst case
- linear programming
- valid inequalities
- open shop
- constant factor
- optimal solution
- approximation ratio
- primal dual
- linear programming relaxation
- approximation schemes
- branch and bound
- lower bound
- undirected graph
- disjoint paths
- randomized algorithms
- production planning
- lp relaxation
- precedence constraints
- np complete
- dynamic programming
- reinforcement learning
- polynomial time approximation
- branch and bound algorithm
- scheduling problem
- state space
- constant factor approximation