A fast asymptotic approximation scheme for bin packing with rejection.

Wolfgang W. Bein José R. Correa Xin Han

Published in: Theor. Comput. Sci. (2008)

Keyphrases

bin packing
polynomial time approximation
approximation schemes
assembly line balancing
graph colouring
cutting stock
search tree
packing problem
marginal likelihood
randomized approximation
genetic algorithm
error bounds
approximation algorithms
similarity search
queueing networks
asymptotically optimal