{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T05:23:32Z","timestamp":1750397012715},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_8","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"69-84","source":"Crossref","is-referenced-by-count":12,"title":["Optimal Carpet Cutting"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Schutt","sequence":"first","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]},{"given":"Andrew R.","family":"Verden","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"8_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Math. Comput. Model.\u00a017(7), 57\u201373 (1993)","journal-title":"Math. Comput. Model."},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-74970-7_15","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N. Beldiceanu","year":"2007","unstructured":"Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., Truchet, C.: A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 180\u2013194. Springer, Heidelberg (2007)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-45578-7_26","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"N. Beldiceanu","year":"2001","unstructured":"Beldiceanu, N., Carlsson, M.: Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 377\u2013391. Springer, Heidelberg (2001)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-68155-7_5","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"N. Beldiceanu","year":"2008","unstructured":"Beldiceanu, N., Carlsson, M., Poder, E.: New filtering for the cumulative constraint in the context of non-overlapping rectangles. In: Trick, M.A. (ed.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 21\u201335. Springer, Heidelberg (2008)"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"S.P. Fekete","year":"2007","unstructured":"Fekete, S.P., Schepers, J., van der Veen, J.C.: An exact algorithm for higher-dimensional orthogonal packing. Oper. Res.\u00a055(3), 569\u2013587 (2007)","journal-title":"Oper. Res."},{"key":"8_CR6","volume-title":"The Theory of Partitions","author":"A.E. George","year":"1998","unstructured":"George, A.E.: The Theory of Partitions. Cambridge University Press, Cambridge (1998)"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0377-2217(93)E0278-6","volume":"83","author":"E. Hadjiconstantinou","year":"1995","unstructured":"Hadjiconstantinou, E., Christofides, N.: An exact algorithm for general, orthogonal, two-dimensional knapsack problems. Eur. J. Oper. Res.\u00a083(1), 39\u201356 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"8_CR8","first-page":"209","volume":"294","author":"A. Lahrichi","year":"1982","unstructured":"Lahrichi, A.: Scheduling: the notions of hump, compulsory parts and their use in cumulative problems. C. R. Acad. Sci., Paris, S\u00e9r. I, Math.\u00a0294(2), 209\u2013211 (1982)","journal-title":"C. R. Acad. Sci., Paris, S\u00e9r. I, Math."},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A. Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: A survey. Eur. J. Oper. Res.\u00a0141(2), 241\u2013252 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"8_CR10","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 Appl. Math.\u00a028(1), 59\u201370 (1990)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S. Martello","year":"1998","unstructured":"Martello, S., Vigo, D.: Exact solution of the two-dimensional finite bin packing problem. Manage. Sci.\u00a044(3), 388\u2013399 (1998)","journal-title":"Manage. Sci."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: DAC 2001, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O. Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints\u00a014(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"key":"8_CR14","unstructured":"Pearson, C., Birtwistle, M., Verden, A.R.: Reducing material wastage in the carpet industry. In: PAP 1998, pp. 101\u2013112 (1998)"},{"key":"8_CR15","unstructured":"Pearson, C., Birtwistle, M., Verden, A.R.: Reducing material wastage in the carpet industry. In: INAP 1998, pp. 88\u201399 (1998)"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/ijoc.1060.0181","volume":"19","author":"D. Pisinger","year":"2007","unstructured":"Pisinger, D., Sigurd, M.: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS J. Comput.\u00a019(1), 36\u201351 (2007)","journal-title":"INFORMS J. Comput."},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/11564751_71","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C. Schulte","year":"2005","unstructured":"Schulte, C., Tack, G.: Views iterators for generic constraint implementations. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 817\u2013821. Springer, Heidelberg (2005), doi:10.1007\/11564751_71"},{"key":"8_CR18","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Solving the resource constrained project scheduling problem with generalized precedences by lazy clause generation (September 2010), http:\/\/arxiv.org\/abs\/1009.0347"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/s10601-010-9103-2","volume":"16","author":"A. Schutt","year":"2011","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Explaining the cumulative propagator. Constraints\u00a016(3), 250\u2013282 (2011)","journal-title":"Constraints"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-85958-1_4","volume-title":"Principles and Practice of Constraint Programming","author":"H. Simonis","year":"2008","unstructured":"Simonis, H., O\u2019Sullivan, B.: Search strategies for rectangle packing. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 52\u201366. Springer, Heidelberg (2008)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/11562931_3","volume-title":"Logic Programming","author":"P.J. Stuckey","year":"2005","unstructured":"Stuckey, P.J., de la Banda, M.G., Maher, M.J., Marriott, K., Slaney, J.K., Somogyi, Z., Wallace, M., Walsh, T.: The G12 project: Mapping solver independent models to efficient solutions. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 9\u201313. Springer, Heidelberg (2005)"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G. W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Hau\u00dfner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res.\u00a0183, 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T16:37:19Z","timestamp":1560530239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}