Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9.
György DósaRongheng LiXin HanZsolt TuzaPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- bin packing
- lower bound
- upper bound
- worst case
- generalization error bounds
- assembly line balancing
- search tree
- branch and bound algorithm
- graph colouring
- cutting stock
- packing problem
- np hard
- traveling salesman problem
- branch and bound
- free form deformation
- database
- scheduling problem
- databases
- multi dimensional
- optimal solution
- genetic algorithm