{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:31:02Z","timestamp":1761895862693},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319076430"},{"type":"electronic","value":"9783319076447"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07644-7_7","type":"book-chapter","created":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T21:27:11Z","timestamp":1401917231000},"page":"85-99","source":"Crossref","is-referenced-by-count":6,"title":["A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem"],"prefix":"10.1007","author":[{"given":"Frederico","family":"Dusberger","sequence":"first","affiliation":[]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A. Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: A survey. European Journal of Operational Research\u00a0141(2), 241\u2013252 (2002)","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1109\/43.552084","volume":"15","author":"H. Murata","year":"1996","unstructured":"Murata, H., Fujiyoshi, K., Nakatake, S., Kajitani, Y.: VLSI module placement based on rectangle-packing by the sequence-pair. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a015(12), 1518\u20131524 (1996)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","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.: An improved typology of cutting and packing problems. European Journal of Operational Research\u00a0183(3), 1109\u20131130 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: \u201cStrong\u201d NP-Completeness Results: Motivation, Examples, and Implications. Journal of the ACM\u00a025(3), 499\u2013508 (1978)","journal-title":"Journal of the ACM"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-24652-7_17","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"J. Puchinger","year":"2004","unstructured":"Puchinger, J., Raidl, G.R., Koller, G.: Solving a Real-World Glass Cutting Problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol.\u00a03004, pp. 165\u2013176. Springer, Heidelberg (2004)"},{"key":"7_CR6","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-79459-9_18","volume-title":"Operations Research Proceedings 1994","author":"A. Fritsch","year":"1995","unstructured":"Fritsch, A., Vornberger, O.: Cutting Stock by Iterated Matching. In: Derigs, U., Bachem, A., Drexl, A. (eds.) Operations Research Proceedings 1994. Operations Research Proceedings, vol.\u00a01994, pp. 92\u201397. Springer, Heidelberg (1995)"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ejor.2007.08.007","volume":"191","author":"G. Cintra","year":"2008","unstructured":"Cintra, G., Miyazawa, F., Wakabayashi, Y., Xavier, E.: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research\u00a0191(1), 61\u201385 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10107-004-0548-1","volume":"102","author":"S.S. Seiden","year":"2005","unstructured":"Seiden, S.S., Woeginger, G.J.: The two-dimensional cutting stock problem revisited. Mathematical Programming\u00a0102(3), 519\u2013530 (2005)","journal-title":"Mathematical Programming"},{"issue":"6","key":"7_CR9","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1287\/mnsc.47.6.864.9809","volume":"47","author":"F. Vanderbeck","year":"2001","unstructured":"Vanderbeck, F.: A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem. Management Science\u00a047(6), 864\u2013879 (2001)","journal-title":"Management Science"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/978-3-540-30217-9_65","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"J. Puchinger","year":"2004","unstructured":"Puchinger, J., Raidl, G.R.: An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol.\u00a03242, pp. 642\u2013651. Springer, Heidelberg (2004)"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"P.C. Gilmore","year":"1965","unstructured":"Gilmore, P.C., Gomory, R.E.: Multistage Cutting Stock Problems of Two and More Dimensions. Operations Research\u00a013(1), 94\u2013120 (1965)","journal-title":"Operations Research"},{"issue":"1","key":"7_CR12","first-page":"23","volume":"34","author":"J.F. Oliveira","year":"1994","unstructured":"Oliveira, J.F., Ferreira, J.S.: A faster variant of the Gilmore and Gomory technique for cutting stock problems. Belgian Journal of Operational Research, Statistics and Computer Science\u00a034(1), 23\u201338 (1994)","journal-title":"Belgian Journal of Operational Research, Statistics and Computer Science"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1287\/ijoc.1040.0089","volume":"18","author":"M. Monaci","year":"2006","unstructured":"Monaci, M., Toth, P.: A Set-Covering-Based Heuristic Approach for Bin-Packing Problems. INFORMS Journal on Computing\u00a018(1), 71\u201385 (2006)","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s00291-002-0093-3","volume":"24","author":"R. Alvarez-Valdes","year":"2002","unstructured":"Alvarez-Valdes, R., Parajon, A., Tamarit, J.M.: A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems. OR Spectrum\u00a024(2), 179\u2013192 (2002)","journal-title":"OR Spectrum"},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1016\/j.ejor.2005.11.064","volume":"183","author":"J. Puchinger","year":"2007","unstructured":"Puchinger, J., Raidl, G.R.: Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research\u00a0183(3), 1304\u20131327 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"7_CR16","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1147\/rd.165.0462","volume":"16","author":"J.C. Herz","year":"1972","unstructured":"Herz, J.C.: Recursive Computational Procedure for Two-dimensional Stock Cutting. IBM Journal of Research and Development\u00a016(5), 462\u2013469 (1972)","journal-title":"IBM Journal of Research and Development"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N. Christofides","year":"1977","unstructured":"Christofides, N., Whitlock, C.: An algorithm for two-dimensional cutting problems. Operations Research\u00a025, 30\u201344 (1977)","journal-title":"Operations Research"},{"issue":"13","key":"7_CR18","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","volume":"123","author":"A. Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics\u00a0123(13), 379\u2013396 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable Neighborhood Search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol.\u00a057, pp. 145\u2013184. Springer (2003)","DOI":"10.1007\/0-306-48056-5_6"},{"issue":"1-3","key":"7_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics\u00a0123(1-3), 75\u2013102 (2002)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G. Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record Breaking Optimization Results Using the Ruin and Recreate Principle. Journal of Computational Physics\u00a0159(2), 139\u2013171 (2000)","journal-title":"Journal of Computational Physics"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Benjamin, J., Julstrom, B.A.: Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem. In: Genetic and Evolutionary Computation Conference, pp. 657\u2013664 (2010)","DOI":"10.1145\/1830483.1830605"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/B:JOCO.0000038915.62826.79","volume":"8","author":"A. Lodi","year":"2004","unstructured":"Lodi, A., Martello, S., Vigo, D.: Models and bounds for two-dimensional level packing problems. Journal of Combinatorial Optimization\u00a08, 363\u2013379 (2004)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"5","key":"7_CR24","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"J.O. Berkey","year":"1987","unstructured":"Berkey, J.O., Wang, P.Y.: Two-Dimensional Finite Bin-Packing Algorithms. The Journal of the Operational Research Society\u00a038(5), 423\u2013429 (1987)","journal-title":"The Journal of the Operational Research Society"},{"issue":"3","key":"7_CR25","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S. Martello","year":"1998","unstructured":"Martello, S., Vigo, D.: Exact Solution of the Two-Dimensional Finite Bin Packing Problem. Management Science\u00a044(3), 388\u2013399 (1998)","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07644-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T00:16:02Z","timestamp":1558916162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07644-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319076430","9783319076447"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07644-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}