Three approximation algorithms for solving the generalized segregated storage problem.
Dariusz BarbuchaPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- exact algorithms
- quadratic program
- primal dual
- minimum cost
- randomized algorithms
- strongly np hard
- facility location problem
- precedence constraints
- approximation ratio
- network design problem
- constant factor
- approximation schemes
- set cover
- open shop
- undirected graph
- scheduling problem
- disjoint paths
- np hardness
- optimal solution
- polynomial time approximation
- combinatorial auctions
- dynamic programming