{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:25:14Z","timestamp":1726410314693},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410185"},{"type":"electronic","value":"9783642410192"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41019-2_19","type":"book-chapter","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T11:31:38Z","timestamp":1379503898000},"page":"257-268","source":"Crossref","is-referenced-by-count":2,"title":["Column Generation Based Heuristic for the Three Dimensional Vehicle Loading Problem"],"prefix":"10.1007","author":[{"given":"Batoul","family":"Mahvash","sequence":"first","affiliation":[]},{"given":"Anjali","family":"Awasthi","sequence":"additional","affiliation":[]},{"given":"Satyaveer","family":"Chauhan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1287\/ijoc.1070.0250","volume":"20","author":"T. Crainic","year":"2008","unstructured":"Crainic, T., Perboli, G., Tadei, R.: Extreme Point-Based Heuristics for Three-Dimensional Bin Packing. INFORMS Journal on Computing\u00a020(3), 368\u2013384 (2008)","journal-title":"INFORMS Journal on Computing"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1016\/j.ejor.2007.06.063","volume":"195","author":"T. Crainic","year":"2009","unstructured":"Crainic, T., Perboli, G., Tadei, R.: TS 2 PACK: A two-level tabu search for the three-dimensional bin packing problem. European Journal of Operational Research\u00a0195, 744\u2013760 (2009)","journal-title":"European Journal of Operational Research"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/S0377-2217(02)00132-7","volume":"141","author":"D. Pisinger","year":"2002","unstructured":"Pisinger, D.: Heuristics for the container loading problem. European Journal of Operational Research\u00a0141, 382\u2013392 (2002)","journal-title":"European Journal of Operational Research"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","volume":"18","author":"M. Iori","year":"2010","unstructured":"Iori, M., Martello, S.: Routing problems with loading constraints. Top\u00a018, 4\u201327 (2010)","journal-title":"Top"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","volume":"48","author":"S. Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., Vigo, D.: The three-dimensional bin packing problem. Operations Research\u00a048, 256\u2013267 (2000)","journal-title":"Operations Research"},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1287\/opre.1050.0210","volume":"53","author":"E. Boef Den","year":"2005","unstructured":"Den Boef, E., Korst, J., Martello, S., Pisinger, D., Vigo, D.: Erratum to \u201cThe three-dimensional bin packing problem\u201d: Robot-packable and orthogonal variants of packing problems. Operations Research\u00a053(4), 735\u2013736 (2005)","journal-title":"Operations Research"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-63397-9_12","volume-title":"Algorithms - ESA \u201997","author":"S. Fekete","year":"1997","unstructured":"Fekete, S., Schepers, J.: A new exact algorithm for general orthogonal d-dimensional knapsack problems. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol.\u00a01284, pp. 144\u2013156. Springer, Heidelberg (1997)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.dam.2003.08.004","volume":"140","author":"M. Boschetti","year":"2004","unstructured":"Boschetti, M.: New lower bounds for the finite three-dimensional bin packing problem. Discrete Applied Mathematics\u00a0140, 241\u2013258 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1111\/j.1475-3995.1997.tb00095.x","volume":"4","author":"H. Gehring","year":"1997","unstructured":"Gehring, H., Bortfeldt, A.: A genetic algorithm for solving the container loading problem. International Transactions in Operational Research\u00a04, 401\u2013418 (1997)","journal-title":"International Transactions in Operational Research"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/S0377-2217(02)00134-0","volume":"141","author":"A. Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Vigo, D.: Heuristic algorithms for the three-dimensional bin packing problem. European Journal of Operational Research\u00a0141, 410\u2013420 (2002)","journal-title":"European Journal of Operational Research"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P. Gilmore","year":"1961","unstructured":"Gilmore, P., Gomory, R.: A linear programming approch to the cutting-stock problem (part I). Operations Research\u00a09, 849\u2013859 (1961)","journal-title":"Operations Research"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"P. Gilmore","year":"1965","unstructured":"Gilmore, P., Gomory, R.: Multistage cutting-stock problems of two and more dimensions. Operations Research\u00a013, 90\u2013120 (1965)","journal-title":"Operations Research"},{"issue":"1","key":"19_CR13","first-page":"23","volume":"34","author":"J. Oliveira","year":"1994","unstructured":"Oliveira, J., Ferreira, J.: A faster variant of the Gilmore and Gomory technique for cutting stock problems. JORBEL- Belgium Journal of Operations Research, Statistics and Computer Science\u00a034(1), 23\u201338 (1994)","journal-title":"JORBEL- Belgium Journal of Operations Research, Statistics and Computer Science"},{"key":"19_CR14","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, 71\u201385 (2006)","journal-title":"INFORMS Journal on Computing"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/ijoc.1060.0181","volume":"19","author":"D. Pisinger","year":"2007","unstructured":"Pisinger, D., Sigurd, M.: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS Journal on Computing\u00a019, 36\u201351 (2007)","journal-title":"INFORMS Journal on Computing"},{"key":"19_CR16","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.: Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research\u00a0183, 1304\u20131327 (2007)","journal-title":"European Journal of Operational Research"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0377-2217(94)00002-T","volume":"80","author":"C. Chen","year":"1995","unstructured":"Chen, C., Lee, S., Shen, Q.: An analytical model for the container loading problem. European Journal of Operational Research\u00a080, 68\u201376 (1995)","journal-title":"European Journal of Operational Research"},{"key":"19_CR18","unstructured":"Ryan, D., Foster, B.: An integer programming approach to scheduling. In: Wren, A. (ed.) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, Amsterdam, The Netherlands, pp. 269\u2013280 (1981)"},{"key":"19_CR19","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"J. Berkey","year":"1987","unstructured":"Berkey, J., Wang, P.: Two dimensional finite bin packing algorithms. Journal of the Operational Research Society\u00a038, 423\u2013429 (1987)","journal-title":"Journal of the Operational Research Society"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41019-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T07:19:42Z","timestamp":1558077582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41019-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410185","9783642410192"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41019-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}