{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:34:27Z","timestamp":1740123267279,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,1,10]],"date-time":"2018-01-10T00:00:00Z","timestamp":1515542400000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10479-018-2762-x","type":"journal-article","created":{"date-parts":[[2018,1,10]],"date-time":"2018-01-10T08:51:31Z","timestamp":1515574291000},"page":"811-829","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case"],"prefix":"10.1007","volume":"271","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5428-9351","authenticated-orcid":false,"given":"John","family":"Martinovic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guntram","family":"Scheithauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,10]]},"reference":[{"key":"2762_CR1","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/PL00009203","volume":"12","author":"N Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Csirik, J., Epstein, L., Sevastianov, S. V., Vestjens, A. P. A., et al. (1998). On-line and off-line approximation algorithms for vector covering problems. Algorithmica, 12, 104\u2013118.","journal-title":"Algorithmica"},{"key":"2762_CR2","unstructured":"Assmann, S. F. (1983). Problems in discrete applied mathematics. Ph.D. thesis, Mathematics Department, Massachusetts Institute of Technology."},{"key":"2762_CR3","doi-asserted-by":"crossref","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. (1984). On a dual version of the one-dimensional bin packing problem. Journal of Algorithms, 5, 502\u2013525.","journal-title":"Journal of Algorithms"},{"issue":"3","key":"2762_CR4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1273340.1273344","volume":"3","author":"A Bar-Noy","year":"2007","unstructured":"Bar-Noy, A., Ladner, R. E., & Tamir, T. (2007). Windows scheduling as a restricted version of bin packing. ACM Transactions on Algorithms, 3(3), 28.","journal-title":"ACM Transactions on Algorithms"},{"key":"2762_CR5","first-page":"333","volume":"22","author":"JL Bruno","year":"1985","unstructured":"Bruno, J. L., & Downey, P. J. (1985). Probabilistic bounds for dual bin-packing. Acta Informatica, 22, 333\u2013345.","journal-title":"Acta Informatica"},{"issue":"4","key":"2762_CR6","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/0885-064X(87)90009-4","volume":"3","author":"EG Coffman","year":"1987","unstructured":"Coffman, E. G., Garey, M. R., & Johnson, D. S. (1987). Bin packing with divisible item sizes. Journal of Complexity, 3(4), 406\u2013428.","journal-title":"Journal of Complexity"},{"key":"2762_CR7","doi-asserted-by":"crossref","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., & Rinnooy Kan, A. H. G. (1991). Probabilistic analysis of algorithms for dual bin packing problems. Journal of Algorithms, 12, 189\u2013203.","journal-title":"Journal of Algorithms"},{"key":"2762_CR8","doi-asserted-by":"publisher","unstructured":"Chen, Y., Song, X., Ouelhadj, D., & Cui, Y. (2017). A heuristic for the skiving and cutting stock problem in paper and plastic film industries. International Transactions in Operational Research. https:\/\/doi.org\/10.1111\/itor.12390.","DOI":"10.1111\/itor.12390"},{"key":"2762_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme, M., Iori, M., & Martello, S. (2016). Bin packing and cutting stock problems: Mathematical models and exact algorithms. European Journal of Operational Research, 255, 1\u201320.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"2762_CR10","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1287\/opre.29.6.1092","volume":"29","author":"H Dyckhoff","year":"1981","unstructured":"Dyckhoff, H. (1981). A new linear approach to the cutting stock problem. Operations Research, 29(6), 1092\u20131104.","journal-title":"Operations Research"},{"key":"2762_CR11","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. (1961). A linear programming approach to the cutting-stock problem (Part I). Operations Research, 9, 849\u2013859.","journal-title":"Operations Research"},{"issue":"3","key":"2762_CR12","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/S003614459531004X","volume":"39","author":"MP Johnson","year":"1997","unstructured":"Johnson, M. P., Rennick, C., & Zak, E. J. (1997). Skiving addition to the cutting stock problem in the paper industry. SIAM Review, 39(3), 472\u2013483.","journal-title":"SIAM Review"},{"key":"2762_CR13","doi-asserted-by":"crossref","unstructured":"Kantorovich, L. V. Mathematical methods of organising and planning production. Management Science, 6, 366\u2013422. (1939 Russian, 1960 English).","DOI":"10.1287\/mnsc.6.4.366"},{"key":"2762_CR14","doi-asserted-by":"crossref","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. (1995). An exact algorithm for the dual bin packing problem. Operations Research Letters, 17, 9\u201318.","journal-title":"Operations Research Letters"},{"issue":"1","key":"2762_CR15","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF01582013","volume":"33","author":"O Marcotte","year":"1985","unstructured":"Marcotte, O. (1985). The cutting stock problem and integer rounding. Mathematical Programming, 33(1), 82\u201392.","journal-title":"Mathematical Programming"},{"issue":"4","key":"2762_CR16","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1109\/LWC.2017.2708105","volume":"6","author":"J Martinovic","year":"2017","unstructured":"Martinovic, J., Jorswieck, E., Scheithauer, G., & Fischer, A. (2017). Integer linear programming formulations for cognitive radio resource allocation. IEEE Wireless Communication Letters, 6(4), 494\u2013497.","journal-title":"IEEE Wireless Communication Letters"},{"issue":"2","key":"2762_CR17","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.ejor.2015.11.005","volume":"251","author":"J Martinovic","year":"2016","unstructured":"Martinovic, J., & Scheithauer, G. (2016a). Integer linear programming models for the skiving stock problem. European Journal of Operational Research, 251(2), 356\u2013368.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2762_CR18","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s00186-016-0552-2","volume":"84","author":"J Martinovic","year":"2016","unstructured":"Martinovic, J., & Scheithauer, G. (2016b). The proper relaxation and the proper gap of the skiving stock problem. Mathematical Methods of Operations Research, 84(3), 527\u2013548.","journal-title":"Mathematical Methods of Operations Research"},{"key":"2762_CR19","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.disopt.2016.06.004","volume":"21","author":"J Martinovic","year":"2016","unstructured":"Martinovic, J., & Scheithauer, G. (2016c). Integer rounding and modified integer rounding for the skiving stock problem. Discrete Optimization, 21, 118\u2013130.","journal-title":"Discrete Optimization"},{"key":"2762_CR20","unstructured":"Martinovic, J., & Scheithauer, G. (2016d). New theoretical investigations on the gap of the skiving stock problem. Preprint MATH-NM-03-2016, Technische Universit\u00e4t Dresden."},{"key":"2762_CR21","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-319-42902-1_7","volume":"2015","author":"J Martinovic","year":"2017","unstructured":"Martinovic, J., & Scheithauer, G. (2017a). LP-based relaxations of the skiving stock problem-Improved upper bounds for the gap. Operations Research Proceedings, 2015, 49\u201354.","journal-title":"Operations Research Proceedings"},{"key":"2762_CR22","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.dam.2017.05.015","volume":"229","author":"J Martinovic","year":"2017","unstructured":"Martinovic, J., & Scheithauer, G. (2017b). An upper bound of $$ \\Delta (E) < 3\/2 $$\u0394(E)<3\/2 for skiving stock instances of the divisible case. Discrete Applied Mathematics, 229, 161\u2013167.","journal-title":"Discrete Applied Mathematics"},{"key":"2762_CR23","unstructured":"Martinovic, J., & Scheithauer, G. (2017c). Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case. Preprint MATH-NM-01-2017, Technische Universit\u00e4t Dresden."},{"key":"2762_CR24","doi-asserted-by":"crossref","unstructured":"Martinovic, J., Scheithauer, G., & de Carvalho, V. (2018). A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems. European Journal of Operational Research, 266(2), 458\u2013471.","DOI":"10.1016\/j.ejor.2017.10.008"},{"key":"2762_CR25","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"G Nemhauser","year":"1988","unstructured":"Nemhauser, G., & Wolsey, L. (1988). Integer and combinatorial optimization. New York: Wiley."},{"issue":"2","key":"2762_CR26","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/j.ejor.2004.06.034","volume":"170","author":"M Peeters","year":"2006","unstructured":"Peeters, M., & Degraeve, Z. (2006). Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem. European Journal of Operational Research, 170(2), 416\u2013439.","journal-title":"European Journal of Operational Research"},{"key":"2762_CR27","series-title":"International series in operations research & management science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-64403-5","volume-title":"Introduction to cutting and packing optimization\u2014Problems, modeling approaches, solution methods","author":"G Scheithauer","year":"2018","unstructured":"Scheithauer, G. (2018). Introduction to cutting and packing optimization\u2014Problems, modeling approaches, solution methods (1st ed., Vol. 623)., International series in operations research & management science Berlin: Springer.","edition":"1"},{"issue":"3","key":"2762_CR28","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1109\/SURV.2012.121112.00047","volume":"15","author":"EZ Tragos","year":"2013","unstructured":"Tragos, E. Z., Zeadally, S., Fragkiadakis, A. G., & Siris, V. A. (2013). Spectrum assignment in cognitive radio networks: A comprehensive survey. IEEE Communications Surveys & Tutorials, 15(3), 1108\u20131135.","journal-title":"IEEE Communications Surveys & Tutorials"},{"issue":"2","key":"2762_CR29","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0377-2217(02)00124-8","volume":"141","author":"JM Val\u00e9rio de Carvalho","year":"2002","unstructured":"Val\u00e9rio de Carvalho, J. M. (2002). LP models for bin packing and cutting stock problems. European Journal of Operations Research, 141(2), 253\u2013273.","journal-title":"European Journal of Operations Research"},{"issue":"3","key":"2762_CR30","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/j.ejor.2012.09.010","volume":"224","author":"B Vijayakumar","year":"2013","unstructured":"Vijayakumar, B., Parikh, P., Scott, R., Barnes, A., & Gallimore, J. (2013). A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital. European Journal of Operational Research, 224(3), 583\u2013591.","journal-title":"European Journal of Operational Research"},{"key":"2762_CR31","doi-asserted-by":"crossref","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. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183, 1109\u20131130.","journal-title":"European Journal of Operational Research"},{"key":"2762_CR32","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1111\/1475-3995.00433","volume":"10","author":"EJ Zak","year":"2003","unstructured":"Zak, E. J. (2003). The skiving stock problem as a counterpart of the cutting stock problem. International Transactions in Operational Research, 10, 637\u2013650.","journal-title":"International Transactions in Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2762-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2762-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2762-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T14:52:51Z","timestamp":1693407171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2762-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,10]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["2762"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2762-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2018,1,10]]}}}