Bin Packing Approximation Algorithms: Combinatorial Analysis

Edward G. Coffman (), Gabor Galambos (), Silvano Martello () and Daniele Vigo ()
Additional contact information
Edward G. Coffman: Lucent Technologies, Bell Labs
Gabor Galambos: Teacher’s Training College, Computer Science Department
Silvano Martello: University of Bologna, DEIS
Daniele Vigo: University of Bologna, DEIS

A chapter in Handbook of Combinatorial Optimization, 1999, pp 151-207 from Springer

Abstract: Abstract In the classical version of the bin packing problem one is given a list L = (a 1,...,a n ) of items (or elements) and an infinite supply of bins with capacity C. A function s(a i ) gives the size of item a i , and satisfies 0

Keywords: Online Algorithm; Item Size; Longe Processing Time; Current Item; Closing Rule (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-3023-4_3

Ordering information: This item can be ordered from
http://www.springer.com/9781475730234

DOI: 10.1007/978-1-4757-3023-4_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().