Abstract
The Bin Packing (BP) problem is one of the more celebrated members of the class of problems commonly titled “combinatorial optimization”. Other famous ones are machine scheduling, the knapsack problem, job assignment, the traveling salesman itinerary and many more. Practically all of these problems may be viewed as special cases of integer programming, but they display special structure and characteristics which have led to specialized algorithms and approaches. While the fame of the BP problem derives to no little extent from its being simple to present and relatively easy to analyze, the significance of many others of this class of problems derives from their commercial value in a business environment; hence the great interest in them. Karp (1986) gives a sweeping overview of the field.
-How do you seat four elephants in a car?
-Two in the front seat, two in the back.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Hofri, M. (1987). Bin Packing Heuristics. In: Probabilistic Analysis of Algorithms. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4800-2_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4800-2_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9160-2
Online ISBN: 978-1-4612-4800-2
eBook Packages: Springer Book Archive