{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:02:26Z","timestamp":1774368146217,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,8,3]],"date-time":"2018-08-03T00:00:00Z","timestamp":1533254400000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10898-018-0696-0","type":"journal-article","created":{"date-parts":[[2018,8,3]],"date-time":"2018-08-03T00:59:05Z","timestamp":1533257945000},"page":"467-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Large proper gaps in bin packing and dual bin packing problems"],"prefix":"10.1007","volume":"74","author":[{"given":"Vadim M.","family":"Kartak","sequence":"first","affiliation":[]},{"given":"Artem V.","family":"Ripatti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,3]]},"reference":[{"issue":"2","key":"696_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/B:HEUR.0000026267.44673.ed","volume":"10","author":"ACF Alvim","year":"2004","unstructured":"Alvim, A.C.F., Ribeiro, C.C., Glover, F., Aloise, D.J.: A hybrid improvement heuristic for the one-dimensional bin packing problem. J. Heuristics 10(2), 205\u2013229 (2004)","journal-title":"J. Heuristics"},{"issue":"4","key":"696_CR2","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"SF Assmann","year":"1984","unstructured":"Assmann, S.F., Johnson, D.S., Kleitman, D.J., Leung, J.Y.T.: On a dual version of the one-dimensional bin packing problem. J. Algorithms 5(4), 502\u2013525 (1984)","journal-title":"J. Algorithms"},{"issue":"4","key":"696_CR3","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0602044","volume":"2","author":"S Baum","year":"1981","unstructured":"Baum, S., Trotter Jr., L.: Integer rounding for polymatroid and branching optimization problems. SIAM J. Algebr. Discret. Methods 2(4), 416\u2013425 (1981)","journal-title":"SIAM J. Algebr. Discret. Methods"},{"issue":"3","key":"696_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF00265685","volume":"22","author":"J Bruno","year":"1985","unstructured":"Bruno, J., Downey, P.: Probabilistic bounds for dual bin-packing. Acta Inform. 22(3), 333\u2013345 (1985)","journal-title":"Acta Inform."},{"issue":"1","key":"696_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-014-0791-z","volume":"150","author":"A Caprara","year":"2015","unstructured":"Caprara, A., Dell\u2019Amico, M., D\u00edaz, J.C.D., Iori, M., Rizzi, R.: Friendly bin packing instances without integer round-up property. Math. Program. 150(1), 5\u201317 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"696_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0196-6774(91)90001-F","volume":"12","author":"J Csirik","year":"1991","unstructured":"Csirik, J., Frenk, J.B.G., Galambos, G., Kan, A.H.G.R.: Probabilistic analysis of algorithms for dual bin packing problems. J. Algorithms 12(2), 189\u2013203 (1991)","journal-title":"J. Algorithms"},{"issue":"6","key":"696_CR7","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P Gilmore","year":"1961","unstructured":"Gilmore, P., Gomory, R.: A linear programming approach to the cutting-stock problem. Oper. Res. 9(6), 849\u2013859 (1961)","journal-title":"Oper. Res."},{"key":"696_CR8","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.dam.2015.02.020","volume":"187","author":"VM Kartak","year":"2015","unstructured":"Kartak, V.M., Ripatti, A.V., Scheithauer, G., Kurz, S.: Minimal proper non-IRUP instances of the one-dimensional cutting stock problem. Discret. Appl. Math. 187, 120\u2013129 (2015). (Complete)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"696_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-6377(94)00060-J","volume":"17","author":"M Labb\u00e9","year":"1995","unstructured":"Labb\u00e9, M., Laporte, G., Martello, S.: An exact algorithm for the dual bin packing problem. Oper. Res. Lett. 17(1), 9\u201318 (1995)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"696_CR10","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BF01582013","volume":"33","author":"O Marcotte","year":"1985","unstructured":"Marcotte, O.: The cutting stock problem and integer rounding. Math. Program. 33(1), 82\u201392 (1985)","journal-title":"Math. Program."},{"issue":"5","key":"696_CR11","doi-asserted-by":"publisher","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(5), 239\u2013243 (1986)","journal-title":"Oper. Res. Lett."},{"key":"696_CR12","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.disopt.2016.06.004","volume":"21","author":"J Martinovic","year":"2016","unstructured":"Martinovic, J., Scheithauer, G.: Integer rounding and modified integer rounding for the skiving stock problem. Discret. Optim. 21, 118\u2013130 (2016)","journal-title":"Discret. Optim."},{"issue":"3","key":"696_CR13","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00186-016-0552-2","volume":"84","author":"J Martinovic","year":"2016","unstructured":"Martinovic, J., Scheithauer, G.: The proper relaxation and the proper gap of the skiving stock problem. Math. Meth. Oper. Res. 84(3), 527\u2013548 (2016)","journal-title":"Math. Meth. Oper. Res."},{"issue":"3","key":"696_CR14","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/S0377-2217(97)00404-9","volume":"112","author":"C Nitsche","year":"1999","unstructured":"Nitsche, C., Scheithauer, G., Terno, J.: Tighter relaxations for the cutting stock problem. Eur. J. Oper. Res. 112(3), 654\u2013663 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"696_CR15","unstructured":"Peeters, M.: One dimensional cutting and packing: new problems and algorithms. Ph.D. thesis, Katholieke Universiteit Leuven (2002)"},{"issue":"2","key":"696_CR16","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.ejor.2004.06.034","volume":"170","author":"M Peeters","year":"2006","unstructured":"Peeters, M., Degraeve, Z.: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem. Eur. J. Oper. Res. 170(2), 416\u2013439 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"696_CR17","doi-asserted-by":"publisher","first-page":"1929","DOI":"10.1016\/j.dam.2007.08.052","volume":"156","author":"J Rietz","year":"2008","unstructured":"Rietz, J., Dempe, S.: Large gaps in one-dimensional cutting stock problems. Discret. Appl. Math. 156(10), 1929\u20131935 (2008)","journal-title":"Discret. Appl. Math."},{"key":"696_CR18","doi-asserted-by":"crossref","unstructured":"Scheithauer, G., Terno, J.: About the gap between the optimal values of the integer and continuous relaxation one-dimensional cutting stock problem. In: Operations Research Proceedings 1991, pp. 439\u2013444. Springer (1992)","DOI":"10.1007\/978-3-642-46773-8_111"},{"issue":"3","key":"696_CR19","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/0377-2217(95)00022-I","volume":"84","author":"G Scheithauer","year":"1995","unstructured":"Scheithauer, G., Terno, J.: The modified integer round-up property of the one-dimensional cutting stock problem. Eur. J. Oper. Res. 84(3), 562\u2013571 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"696_CR20","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0167-6377(96)00047-8","volume":"20","author":"G Scheithauer","year":"1997","unstructured":"Scheithauer, G., Terno, J.: Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem. Oper. Res. Lett. 20(2), 93\u2013100 (1997)","journal-title":"Oper. Res. Lett."},{"key":"696_CR21","first-page":"168","volume":"1","author":"RP Stanley","year":"1980","unstructured":"Stanley, R.P.: Weyl groups, the hard Lefschetz theorem, and the Sperner property. SIAM J. Matrix Anal. Appl. 1, 168\u2013184 (1980)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"696_CR22","first-page":"3","volume":"16","author":"B Sullivan","year":"2013","unstructured":"Sullivan, B.: On a conjecture of Andrica and Tomescu. J. Integer Seq. 16, 3 (2013). (Article 13.3.1)","journal-title":"J. Integer Seq."},{"issue":"3","key":"696_CR23","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.ejor.2012.09.010","volume":"224","author":"B Vijayakumar","year":"2013","unstructured":"Vijayakumar, B., Parikh, P.J., Scott, R., Barnes, A., Gallimore, J.: A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital. Eur. J. Oper. Res. 224(3), 583\u2013591 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"696_CR24","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1111\/1475-3995.00433","volume":"10","author":"EJ Zak","year":"2003","unstructured":"Zak, E.J.: The skiving stock problem as a counterpart of the cutting stock problem. Int. Trans. Oper. Res. 10(6), 637\u2013650 (2003)","journal-title":"Int. Trans. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0696-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0696-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0696-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T13:26:38Z","timestamp":1579181198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0696-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,3]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["696"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0696-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,3]]},"assertion":[{"value":"15 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}