On the worst-case performance of the NkF bin-packing heuristic.

János Csirik Balázs Imreh

Published in: Acta Cybern. (1989)

Keyphrases

bin packing
worst case
cutting stock
graph colouring
assembly line balancing
packing problem
lower bound
greedy algorithm
search tree
average case
upper bound
error bounds
running times
multi dimensional
np hard
approximation algorithms
optimal solution