{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:56:13Z","timestamp":1771030573578,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540232414","type":"print"},{"value":"9783540302018","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30201-8_47","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T21:14:37Z","timestamp":1285190077000},"page":"648-662","source":"Crossref","is-referenced-by-count":54,"title":["A Constraint for Bin Packing"],"prefix":"10.1007","author":[{"given":"Paul","family":"Shaw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"J. Valerio de Carvalho","year":"1999","unstructured":"Valerio de Carvalho, J.: Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research\u00a086, 629\u2013659 (1999)","journal-title":"Annals of Operations Research"},{"key":"47_CR2","first-page":"46","volume-title":"Appoximation algorithms for NP-Hard Problems","author":"E.G. Coffman Jr.","year":"1996","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survery. In: Hochbaum, D. (ed.) Appoximation algorithms for NP-Hard Problems, pp. 46\u201393. PWS Publishing, Boston (1996)"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E. Falkenauer","year":"1996","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics\u00a02, 5\u201330 (1996)","journal-title":"Journal of Heuristics"},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"D.K. Friesen","year":"1986","unstructured":"Friesen, D.K., Langston, M.A.: Variable sized bin packing. SIAM Journal on Computing\u00a015, 222\u2013230 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"47_CR5","unstructured":"Gent, I., Walsh, T.: From approximate to optimal solutions: Constructing pruning and propagation rules. In: Proceedings of the 15th IJCAI (1997)"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1009678411503","volume":"3","author":"I.P. Gent","year":"1998","unstructured":"Gent, I.P.: Heuristic solution of open bin packing problems. Journal of Heuristics\u00a03, 299\u2013304 (1998)","journal-title":"Journal of Heuristics"},{"key":"47_CR7","unstructured":"ILOG S.A., Gentilly, France. ILOG Solver 6.0. User Manual (September 2003)"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Fast algorithms for bin packing. Journal of Computer and System Sciences\u00a08, 272\u2013314 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"47_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)"},{"key":"47_CR10","unstructured":"Korf, R.: A new algorithm for optimal bin packing. In: Proceedings of 18th AAAI, pp. 731\u2013736 (2002)"},{"key":"47_CR11","unstructured":"Korf, R.: An improved algorithm for optimal bin packing. In: Proceedings of the 18th IJCAI, pp. 1252\u20131258 (2003)"},{"key":"47_CR12","volume-title":"Knapsack problems","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack problems. Wiley, Chichester (1990)"},{"issue":"1","key":"47_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Discrete and Applied Mathematics\u00a028(1), 59\u201370 (1990)","journal-title":"Discrete and Applied Mathematics"},{"key":"47_CR14","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the 12th AAAI. American Association for Artificial Intelligence, pp. 362\u2013367. AAAI Press \/ The MIT Press (1994)"},{"key":"47_CR15","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","volume":"24","author":"A. Scholl","year":"1997","unstructured":"Scholl, A., Klein, R., J\u00fcrgens, C.: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research\u00a024, 627\u2013645 (1997)","journal-title":"Computers & Operations Research"},{"key":"47_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-540-45193-8_46","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M.: Approximated consistency for knapsack constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 679\u2013693. Springer, Heidelberg (2003)"},{"key":"47_CR17","unstructured":"Trick, M.: A dynamic programming approach for consistency and propagation for knapsack constraints. In: Proceedings of CP-AI-OR 2001 (2001)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30201-8_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:54:25Z","timestamp":1620014065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30201-8_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232414","9783540302018"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30201-8_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}