Approximation algorithms for the oriented two-dimensional bin packing problem.
Andrea LodiSilvano MartelloDaniele VigoPublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- approximation algorithms
- precedence constraints
- packing problem
- np hard
- vertex cover
- worst case
- special case
- lower bound
- set cover
- minimum cost
- approximation ratio
- facility location problem
- network design problem
- primal dual
- exact algorithms
- approximation schemes
- knapsack problem
- bin packing
- np hardness
- open shop
- undirected graph
- branch and bound algorithm
- constant factor
- search algorithm
- combinatorial auctions
- greedy algorithm
- constraint satisfaction problems
- scheduling problem