{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:14:28Z","timestamp":1761621268505},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,6,21]],"date-time":"2016-06-21T00:00:00Z","timestamp":1466467200000},"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":["Math Meth Oper Res"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s00186-016-0552-2","type":"journal-article","created":{"date-parts":[[2016,6,21]],"date-time":"2016-06-21T05:55:11Z","timestamp":1466488511000},"page":"527-548","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["The proper relaxation and the proper gap of the skiving stock problem"],"prefix":"10.1007","volume":"84","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":[[2016,6,21]]},"reference":[{"issue":"2","key":"552_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 ACF, Ribeiro CC, Glover F, Aloise DJ (2004) A hybrid improvement heuristic for the one-dimensional bin packing problem. J Heuristics 10(2):205\u2013229","journal-title":"J Heuristics"},{"key":"552_CR2","unstructured":"Assmann SF (1983) Problems in discrete applied mathematics. PhD thesis, Mathematics Department, Massachusetts Institute of Technology"},{"key":"552_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 SF, Johnson DS, Kleitman DJ, Leung JY-T (1984) On a dual version of the one-dimensional bin packing problem. J Algorithms 5:502\u2013525","journal-title":"J Algorithms"},{"key":"552_CR4","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0602044","volume":"2","author":"S Baum","year":"1981","unstructured":"Baum S, Trotter LE (1981) Integer rounding for polymatroid and branching optimization problems. SIAM J Algebraic Discret Methods 2:416\u2013425","journal-title":"SIAM J Algebraic Discret Methods"},{"key":"552_CR5","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.cor.2015.11.009","volume":"69","author":"F Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o F, Pedroso JP (2016) Bin packing and related problems: general arc-flow formulation with graph compression. Comput Oper Res 69:56\u201367","journal-title":"Comput Oper Res"},{"key":"552_CR6","first-page":"333","volume":"22","author":"JL Bruno","year":"1985","unstructured":"Bruno JL, Downey PJ (1985) Probabilistic bounds for dual bin-packing. Acta Inf 22:333\u2013345","journal-title":"Acta Inf"},{"issue":"1\u20133","key":"552_CR7","first-page":"213","volume":"83","author":"LMA Chan","year":"1998","unstructured":"Chan LMA, Simchi-Levi D, Bramel J (1998) Worst-case analyses, linear programming and the bin-packing problem. Math Program 83(1\u20133):213\u2013227","journal-title":"Math Program"},{"key":"552_CR8","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 JBG, Galambos G, Rinnooy Kan AHG (1991) Probabilistic analysis of algorithms for dual bin packing problems. J Algorithms 12:189\u2013203","journal-title":"J Algorithms"},{"issue":"2","key":"552_CR9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0377-2217(02)00124-8","volume":"141","author":"JM Carvalho Val\u00e9rio de","year":"2002","unstructured":"de Carvalho Val\u00e9rio JM (2002) LP models for bin packing and cutting stock problems. Eur J Oper Res 141(2):253\u2013273","journal-title":"Eur J Oper Res"},{"key":"552_CR10","first-page":"4","volume":"5","author":"M Fieldhouse","year":"1990","unstructured":"Fieldhouse M (1990) The duality gap in trim problems. SICUP Bull 5:4\u20135","journal-title":"SICUP Bull"},{"key":"552_CR11","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem (Part I). Oper Res 9:849\u2013859","journal-title":"Oper Res"},{"issue":"3","key":"552_CR12","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/S003614459531004X","volume":"39","author":"MP Johnson","year":"1997","unstructured":"Johnson MP, Rennick C, Zak EJ (1997) Skiving addition to the cutting stock problem in the paper industry. SIAM Rev 39(3):472\u2013483","journal-title":"SIAM Rev"},{"key":"552_CR13","doi-asserted-by":"crossref","unstructured":"Kantorovich LV (1939 Russian, 1960 English) Mathematical methods of organising and planning production. Manag Sci 6:366\u2013422","DOI":"10.1287\/mnsc.6.4.366"},{"key":"552_CR14","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.dam.2015.02.020","volume":"187","author":"VM Kartak","year":"2015","unstructured":"Kartak VM, Ripatti AV, Scheithauer G, Kurz S (2015) Minimal proper non-IRUP instances of the one-dimensional cutting stock problem. Discret Appl Math 187:120\u2013129","journal-title":"Discret Appl Math"},{"key":"552_CR15","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. Oper Res Lett 17:9\u201318","journal-title":"Oper Res Lett"},{"issue":"5","key":"552_CR16","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 (1986) An instance of the cutting stock problem for which the rounding property does not hold. Oper Res Lett 4(5):239\u2013243","journal-title":"Oper Res Lett"},{"key":"552_CR17","doi-asserted-by":"crossref","unstructured":"Martinovic J, Scheithauer G (2015a) Integer rounding and modified integer rounding for the skiving stock problem. Dresden University of Technology, Preprint MATH-NM-02-2015","DOI":"10.1016\/j.disopt.2016.06.004"},{"key":"552_CR18","unstructured":"Martinovic J, Scheithauer G (2015b) The proper relaxation and the proper gap of the skiving stock problem. Dresden University of Technology, Preprint MATH-NM-04-2015"},{"key":"552_CR19","doi-asserted-by":"crossref","unstructured":"Martinovic J, Scheithauer G (2016a) LP-based relaxations of the skiving stock problem\u2014improved upper bounds for the gap. Proceedings of the Operations Research Conference 2015, Wien 2015 (to appear)","DOI":"10.1007\/978-3-319-42902-1_7"},{"key":"552_CR20","doi-asserted-by":"crossref","unstructured":"Martinovic J, Scheithauer G (2016b) Integer linear programming models for the skiving stock problem. Eur J Oper Res 251(2):356\u2013368","DOI":"10.1016\/j.ejor.2015.11.005"},{"key":"552_CR21","unstructured":"Martinovic J, Jorswieck E, Scheithauer G (2016c) The skiving stock problem and its application to cognitive radio networks. In: Proceedings of the 8th IFAC conference on modelling, management and control (to appear)"},{"issue":"3","key":"552_CR22","doi-asserted-by":"crossref","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 (1999) Tighter relaxations for the cutting stock problem. Eur J Oper Res 112(3):654\u2013663","journal-title":"Eur J Oper Res"},{"issue":"2","key":"552_CR23","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. Eur J Oper Res 170(2):416\u2013439","journal-title":"Eur J Oper Res"},{"key":"552_CR24","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 (2002) Families of non-IRUP instances of the one-dimensional cutting stock problem. Discret Appl Math 121:229\u2013245","journal-title":"Discret Appl Math"},{"key":"552_CR25","unstructured":"Scheithauer G (2008) Zuschnitt- und Packungsoptimierung\u2014Problemstellungen, Modellierungstechniken, L\u00f6sungsmethoden, 1st edn. Vieweg+Teubner, Wiesbaden"},{"issue":"3","key":"552_CR26","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1109\/SURV.2012.121112.00047","volume":"15","author":"EZ Tragos","year":"2013","unstructured":"Tragos EZ, Zeadally S, Fragkiadakis AG, Siris VA (2013) Spectrum assignment in cognitive radio networks: a comprehensive survey. IEEE Commun Surv Tutor 15(3):1108\u20131135","journal-title":"IEEE Commun Surv Tutor"},{"issue":"3","key":"552_CR27","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. Eur J Oper Res 224(3):583\u2013591","journal-title":"Eur J Oper Res"},{"key":"552_CR28","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/S0167-5060(08)70758-1","volume":"1","author":"LA Wolsey","year":"1977","unstructured":"Wolsey LA (1977) Valid inequalities, covering problems and discrete dynamic programs. Ann Discret Math 1:527\u2013538","journal-title":"Ann Discret Math"},{"key":"552_CR29","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1111\/1475-3995.00433","volume":"10","author":"EJ Zak","year":"2003","unstructured":"Zak EJ (2003) The skiving stock problem as a counterpart of the cutting stock problem. Int Trans Oper Res 10:637\u2013650","journal-title":"Int Trans Oper Res"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-016-0552-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-016-0552-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-016-0552-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-016-0552-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T20:55:40Z","timestamp":1568062540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-016-0552-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,21]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["552"],"URL":"https:\/\/doi.org\/10.1007\/s00186-016-0552-2","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,21]]}}}