A note on dual approximation algorithms for class constrained bin packing problems.
Eduardo C. XavierFlávio Keidi MiyazawaPublished in: RAIRO Theor. Informatics Appl. (2009)
Keyphrases
- approximation algorithms
- primal dual
- packing problem
- np hard
- vertex cover
- special case
- worst case
- constant factor
- bin packing
- minimum cost
- cutting stock
- facility location problem
- network design problem
- np hardness
- approximation ratio
- randomized algorithms
- integer programming
- open shop
- approximation schemes
- precedence constraints
- undirected graph
- set cover
- learning algorithm
- lot sizing
- computational complexity
- optimal solution