{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:47:04Z","timestamp":1725979624193},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319899190"},{"type":"electronic","value":"9783319899206"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89920-6_25","type":"book-chapter","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:59:40Z","timestamp":1527253180000},"page":"179-184","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case"],"prefix":"10.1007","author":[{"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,5,26]]},"reference":[{"key":"25_CR1","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. (1984). On a dual version of the one-dimensional bin packing problem. Journal of Algorithms, 5, 502\u2013525.","journal-title":"Journal of Algorithms"},{"key":"25_CR2","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. To appear in: International Transactions in Operational Research, \nhttps:\/\/doi.org\/10.1111\/itor.12390\n\n.","DOI":"10.1111\/itor.12390"},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","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"},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","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":"25_CR5","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.ejor.2015.11.005","volume":"251","author":"J Martinovic","year":"2016","unstructured":"Martinovic, J., & Scheithauer, G. (2016). 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"},{"key":"25_CR6","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. (2016). Integer rounding and modified integer rounding for the skiving stock problem. Discrete Optimization, 21, 118\u2013130.","journal-title":"Discrete Optimization"},{"key":"25_CR7","unstructured":"Martinovic, J., & Scheithauer, G. (2016). New Theoretical Investigations on the Gap of the Skiving Stock Problem. Preprint MATH-NM-03-2016, Technische Universit\u00e4t Dresden"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.dam.2017.05.015","volume":"229","author":"J Martinovic","year":"2017","unstructured":"Martinovic, J., & Scheithauer, G. (2017). An upper bound of $$\\Delta (E) < 3\/2$$ for skiving stock instances of the divisible case. Discrete Applied Mathematics, 229, 161\u2013167.","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR9","doi-asserted-by":"publisher","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":["Operations Research Proceedings","Operations Research Proceedings 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89920-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T13:10:49Z","timestamp":1527253849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89920-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319899190","9783319899206"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89920-6_25","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2018]]}}}