×

zbMATH — the first resource for mathematics

Consistency check for the bin packing constraint revisited. (English) Zbl 1285.68156
Lodi, Andrea (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 7th international conference, CPAIOR 2010, Bologna, Italy, June 14–18, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13519-4/pbk). Lecture Notes in Computer Science 6140, 117-122 (2010).
Summary: The bin packing problem (BP) consists in finding the minimum number of bins necessary to pack a set of items so that the total size of the items in each bin does not exceed the bin capacity \(C\). The bin capacity is common for all the bins.
For the entire collection see [Zbl 1189.68014].

MSC:
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
90C27 Combinatorial optimization
PDF BibTeX XML Cite
Full Text: DOI