{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:17:11Z","timestamp":1743074231417,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319429014"},{"type":"electronic","value":"9783319429021"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-42902-1_7","type":"book-chapter","created":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T21:21:19Z","timestamp":1488835279000},"page":"49-54","source":"Crossref","is-referenced-by-count":4,"title":["LP-Based Relaxations of the Skiving Stock Problem\u2014Improved Upper Bounds for the Gap"],"prefix":"10.1007","author":[{"given":"John","family":"Martinovic","sequence":"first","affiliation":[]},{"given":"Guntram","family":"Scheithauer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,8]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"crossref","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"},{"key":"7_CR2","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.: On a dual version of the one-dimensional bin packing problem. J. Algorithms 5, 502\u2013525 (1984)","journal-title":"J. Algorithms"},{"key":"7_CR3","first-page":"333","volume":"22","author":"JL Bruno","year":"1985","unstructured":"Bruno, J.L., Downey, P.J.: Probabilistic bounds for dual bin-packing. Acta Informatica 22, 333\u2013345 (1985)","journal-title":"Acta Informatica"},{"key":"7_CR4","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.: Probabilistic analysis of algorithms for dual bin packing problems. J. Algorithms 12, 189\u2013203 (1991)","journal-title":"J. Algorithms"},{"issue":"3","key":"7_CR5","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.: Skiving addition to the cutting stock problem in the paper industry. SIAM Rev. 39(3), 472\u2013483 (1997)","journal-title":"SIAM Rev."},{"key":"7_CR6","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.: An exact algorithm for the dual bin packing problem. Oper. Res. Lett. 17, 9\u201318 (1995)","journal-title":"Oper. Res. Lett."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Martinovic, J., Scheithauer, G.: Integer rounding and modified integer rounding for the skiving stock problem. Discrete Optimiz 21, 118\u2013130 (2016)","DOI":"10.1016\/j.disopt.2016.06.004"},{"key":"7_CR8","unstructured":"Martinovic, J., Scheithauer, G.: Improved upper bounds for the gap of the skiving stock problem. Preprint MATH-NM-03-2015, Technische Universit\u00e4t Dresden (2015)"},{"issue":"2","key":"7_CR9","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.: Integer linear programming models for the skiving stock problem. Eur. J. Oper. Res. 251(2), 356\u2013368 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"7_CR10","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.: 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."},{"key":"7_CR11","unstructured":"Rietz, J.: Untersuchungen zu MIRUP f\u00fcr Vektorpackprobleme. Ph.D. thesis, TU Bergakademie Freiberg (2003)"},{"issue":"3","key":"7_CR12","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.: 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."},{"key":"7_CR13","doi-asserted-by":"crossref","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, 637\u2013650 (2003)","journal-title":"Int. Trans. Oper. Res."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42902-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T08:25:23Z","timestamp":1515054323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42902-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319429014","9783319429021"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42902-1_7","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2017]]}}}