{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:18:32Z","timestamp":1742941112625,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160530"},{"type":"electronic","value":"9783642160547"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16054-7_14","type":"book-chapter","created":{"date-parts":[[2010,9,30]],"date-time":"2010-09-30T22:07:50Z","timestamp":1285884470000},"page":"190-205","source":"Crossref","is-referenced-by-count":9,"title":["SearchCol: Metaheuristic Search by Column Generation"],"prefix":"10.1007","author":[{"given":"Filipe","family":"Alvelos","sequence":"first","affiliation":[]},{"given":"Amaro","family":"de Sousa","sequence":"additional","affiliation":[]},{"given":"Dorabella","family":"Santos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/opre.47.6.862","volume":"47","author":"J.M. Akker van den","year":"1999","unstructured":"van den Akker, J.M., Hoogeveen, J.A., van de Velde, S.L.: Parallel machine scheduling by column generation. Operations Research\u00a047, 862\u2013872 (1999)","journal-title":"Operations Research"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1287\/opre.1060.0278","volume":"54","author":"H. Ben Amor","year":"2006","unstructured":"Ben Amor, H., Desrosiers, J., Val\u00e9rio de Carvalho, J.M.: Dual-optimal inequalities for stabilized column generation. Operations Research\u00a054, 454\u2013463 (2006)","journal-title":"Operations Research"},{"key":"14_CR3","unstructured":"Alvelos, F., Val\u00e9rio de Carvalho, J.M.: Comparing branch-and-price algorithms for the unsplittable multicommodity flow problem. In: Ben-Ameur, W., Petrowski, A. (eds.) Proceedings of the INOC - International Network Optimization Conference, Evry, Paris, pp. 7\u201312 (2003)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/net.20161","volume":"50","author":"F. Alvelos","year":"2007","unstructured":"Alvelos, F., Val\u00e9rio de Carvalho, J.M.: An Extended Model and a Column Generation Algorithm for the Planar Multicommodity Flow Problem. Networks\u00a050, 3\u201316 (2007)","journal-title":"Networks"},{"key":"14_CR5","volume-title":"Column Generation","author":"E. Danna","year":"2005","unstructured":"Danna, E., Pape, C.L.: Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows. In: Desaulniers, G., Descrosiers, J., Solomon, M.M. (eds.) Column Generation,\u00a0ch. 4. Springer Science and Business Media, New York (2005)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Operations Research\u00a08, 101\u2013111 (1960)","journal-title":"Operations Research"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1002\/net.3230140406","volume":"14","author":"J. Desrosiers","year":"1984","unstructured":"Desrosiers, J., Soumis, F., Desrochers, M.: Routing with time windows by column generation. Networks\u00a014, 545\u2013565 (1984)","journal-title":"Networks"},{"volume-title":"Column Generation","year":"2005","key":"14_CR8","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.): Column Generation. Springer, New York (2005)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0927-0507(05)80106-9","volume-title":"Network Routing","author":"J. Desrosiers","year":"1995","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time Constrained Routing and Scheduling. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing, pp. 35\u2013139. North Holland, Amsterdam (1995)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/mnsc.5.1.97","volume":"5","author":"L.R. Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson, D.R.: A suggested computation for maximal multicommodity network flows. Management Science\u00a05, 97\u2013101 (1958)","journal-title":"Management Science"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R. Fukasawa","year":"2006","unstructured":"Fukasawa, R., Longo, H., Lysgaard, J., Poggi de Arag\u00e3o, M., Reis, M., Uchoa, E., Werneck, R.F.: Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. Mathematical Programming, Series A\u00a0106, 491\u2013511 (2006)","journal-title":"Mathematical Programming, Series A"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Operations Research\u00a09, 849\u2013859 (1961)","journal-title":"Operations Research"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P.C. Gilmore","year":"1963","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem - Part II. Operations Research\u00a011, 863\u2013888 (1963)","journal-title":"Operations Research"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10107-008-0251-8","volume":"122","author":"D. Liang","year":"2010","unstructured":"Liang, D., Wilhelm, W.E.: A generalization of column generation to accelerate convergence. Mathematical Programming, Series A\u00a0122, 349\u2013378 (2010)","journal-title":"Mathematical Programming, Series A"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"M.E. L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M.E., Desrosiers, J.: Selected topics in column generation. Operations Research\u00a053, 1007\u20131023 (2005)","journal-title":"Operations Research"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1287\/mnsc.4.2.115","volume":"4","author":"A.S. Manne","year":"1958","unstructured":"Manne, A.S.: Programming of Economic Lot Sizes. Management Science\u00a04, 115\u2013135 (1958)","journal-title":"Management Science"},{"key":"14_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4975-8","volume-title":"Large Scale Linear and Integer Optimization, A Unified Approach","author":"R.K. Martin","year":"1999","unstructured":"Martin, R.K.: Large Scale Linear and Integer Optimization, A Unified Approach. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1080\/10556780902992837","volume":"25","author":"C. Pimentel","year":"2010","unstructured":"Pimentel, C., Alvelos, F.P., Val\u00e9rio de Carvalho, J.M.: Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. Optimization Methods and Software\u00a025, 299\u2013319 (2010)","journal-title":"Optimization Methods and Software"},{"key":"14_CR19","first-page":"1007","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, 1007\u20131023 (2007)","journal-title":"INFORMS Journal on Computing"},{"key":"14_CR20","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, 1304\u20131327 (2007)","journal-title":"European Journal of Operational Research"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11890584_1","volume-title":"Hybrid Metaheuristics","author":"G.R. Raidl","year":"2006","unstructured":"Raidl, G.R.: A Unified View on Hybrid Metaheuristics. In: Almeida, F., Blesa Aguilera, M.J., Blum, C., Moreno Vega, J.M., P\u00e9rez P\u00e9rez, M., Roli, A., Sampels, M. (eds.) HM 2006. LNCS, vol.\u00a04030, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"14_CR22","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/978-3-642-04576-9_8","volume-title":"Traffic Management and Traffic Engineering for the Future Internet","author":"Dorabella Santos","year":"2009","unstructured":"Santos, D., de Sousa, A., Alvelos, F.: Traffic Engineering of Telecommunication Networks based on Multiple Spanning Tree Routing. In: Valadas, R. (ed.) FITraMEn 2008. LNCS, vol.\u00a05464, pp. 114\u2013129. Springer, Heidelberg (2009)"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M. Savelsbergh","year":"2007","unstructured":"Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Operations Research\u00a045, 831\u2013841 (2007)","journal-title":"Operations Research"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10479-005-3455-9","volume":"139","author":"D. Villeneuve","year":"2005","unstructured":"Villeneuve, D., Desrosiers, J., L\u00fcbbecke, M.E., Soumis, F.: On Compact Formulations for Integer Programs Solved by Column Generation. Annals of Operations Research\u00a0139, 375\u2013388 (2005)","journal-title":"Annals of Operations Research"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1013141227104","volume":"2","author":"W.E. Wilhelm","year":"2001","unstructured":"Wilhelm, W.E.: A technical review of column generation in integer programming. Optimization and Engineering\u00a02, 159\u2013200 (2001)","journal-title":"Optimization and Engineering"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16054-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T06:29:35Z","timestamp":1539152975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16054-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160530","9783642160547"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16054-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}