{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:25:09Z","timestamp":1774369509762,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T00:00:00Z","timestamp":1402358400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10107-014-0791-z","type":"journal-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T18:28:40Z","timestamp":1402424920000},"page":"5-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Friendly bin packing instances without Integer Round-up Property"],"prefix":"10.1007","volume":"150","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauro","family":"Dell\u2019Amico","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Carlos","family":"D\u00edaz-D\u00edaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Iori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,10]]},"reference":[{"key":"791_CR1","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/978-1-4419-7997-1_35","volume-title":"Handbook of Combinatorial Optimization","author":"E Coffman","year":"2013","unstructured":"Coffman, E., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Du, D.Z., Pardalos, P., Graham, R. (eds.) Handbook of Combinatorial Optimization, 2nd edn, pp. 455\u2013531. Springer, Berlin (2013)","edition":"2"},{"key":"791_CR2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0377-2217(02)00124-8","volume":"141","author":"J Val\u00e9rio deCarvalho","year":"2002","unstructured":"Val\u00e9rio deCarvalho, J.: LP models for bin packing and cutting stock problems. Eur. J. Oper. Res. 141, 253\u2013273 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"791_CR3","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10479-008-0453-8","volume":"179","author":"F Clautiaux","year":"2009","unstructured":"Clautiaux, F., Alves, C., Val\u00e9rio de Carvalho, J.: A survey of dual-feasible functions for bin-packing problems. Ann. Oper. Res. 179(1), 317\u2013342 (2009)","journal-title":"Ann. Oper. Res."},{"key":"791_CR4","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Oper. Res. 9, 849\u2013859 (1961)","journal-title":"Oper. Res."},{"key":"791_CR5","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P Gilmore","year":"1963","unstructured":"Gilmore, P., Gomory, R.: A linear programming approach to the cutting stock problem: part II. Oper. Res. 11, 863\u2013888 (1963)","journal-title":"Oper. Res."},{"key":"791_CR6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0166-218X(01)00361-4","volume":"121","author":"J Rietz","year":"2002","unstructured":"Rietz, J., Scheithauer, G., Terno, J.: Families of non-IRUP instances of the one-dimensional cutting stock problem. Discrete Appl. Math. 121, 229\u2013245 (2002)","journal-title":"Discrete Appl. Math."},{"key":"791_CR7","unstructured":"Rietz, J., Scheithauer, G., Terno, J.: Tighter bounds for the gap and non-IRUP constructions in the one-dimensional cutting stock problem. Optim. J. Math. Program. Oper. Res. 51, 927\u2013963 (2002)"},{"key":"791_CR8","doi-asserted-by":"crossref","unstructured":"Caprara, A., Monaci, M.: Bidimensional packing by bilinear programming. Math. Program. 118, 75\u2013108 (2009)","DOI":"10.1007\/s10107-007-0184-7"},{"key":"791_CR9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0167-6377(86)90009-X","volume":"4","author":"O Marcotte","year":"1986","unstructured":"Marcotte, O.: An instance of the cutting stock problem for which the rounding property does not hold. Oper. Res. Lett. 4, 239\u2013243 (1986)","journal-title":"Oper. Res. Lett."},{"key":"791_CR10","first-page":"213","volume":"83","author":"L Chan","year":"1998","unstructured":"Chan, L., Simchi-Levi, D., Bramel, J.: Worst-case analyses, linear programming and the bin-packing problem. Math. Program. 83, 213\u2013227 (1998)","journal-title":"Math. Program."},{"key":"791_CR11","first-page":"111","volume":"30","author":"G Scheitauer","year":"1994","unstructured":"Scheitauer, G.: On the maxgap problem for cutting stock. J. Inform. Process. Cybernet. 30, 111\u2013117 (1994)","journal-title":"J. Inform. Process. Cybernet."},{"key":"791_CR12","doi-asserted-by":"crossref","first-page":"24:1","DOI":"10.1145\/2483699.2483704","volume":"9","author":"F Eisenbrand","year":"2013","unstructured":"Eisenbrand, F., P\u00e1lv\u00f6lgyi, D., Rothvo\u00df, T.: Bin packing via discrepancy of permutations. ACM Trans. Algorithms 9, 24:1\u201324:15 (2013)","journal-title":"ACM Trans. Algorithms"},{"key":"791_CR13","first-page":"333","volume":"30","author":"M Dell\u2019Amico","year":"2006","unstructured":"Dell\u2019Amico, M., Iori, M., Monaci, M., Martello, S.: Heuristic and exact algorithms for the identical parallel machine scheduling problem. INFORMS J. Comput. 30, 333\u2013344 (2006)","journal-title":"INFORMS J. Comput."},{"key":"791_CR14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.ejor.2004.08.036","volume":"171","author":"G Belov","year":"2006","unstructured":"Belov, G., Scheithauer, G.: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Eur. J. Oper. Res. 171, 85\u2013106 (2006)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0791-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0791-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0791-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:00:05Z","timestamp":1559109605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0791-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,10]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["791"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0791-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,10]]}}}