The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio.
Shinji ImahoriMutsunori YagiuraPublished in: Comput. Oper. Res. (2010)
Keyphrases
- approximation algorithms
- approximation ratio
- worst case
- packing problem
- np hard
- exact algorithms
- greedy algorithm
- running times
- special case
- optimal solution
- average case
- worst case analysis
- fixed width
- strip packing
- neural network
- error bounds
- search space
- lower bound
- efficient implementation
- minimum cost
- greedy heuristic
- constraint satisfaction
- upper bound
- space complexity
- lower and upper bounds
- integer programming
- solution quality
- simulated annealing
- multi class
- constant factor
- evolutionary algorithm
- computational complexity
- objective function