Login / Signup
A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.
Paolo Dell'Olmo
Hans Kellerer
Maria Grazia Speranza
Zsolt Tuza
Published in:
Inf. Process. Lett. (1998)
Keyphrases
</>
bin packing
computational complexity
error bounds
dynamic programming
expectation maximization
k means
cost function
worst case
search strategy
higher dimensional
assembly line balancing
learning algorithm
error tolerance
polynomial time approximation
tree structure
orders of magnitude
simulated annealing