{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:07:31Z","timestamp":1743008851275,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":66,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642306709"},{"type":"electronic","value":"9783642306716"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-30671-6_11","type":"book-chapter","created":{"date-parts":[[2012,7,31]],"date-time":"2012-07-31T09:07:24Z","timestamp":1343725644000},"page":"285-334","source":"Crossref","is-referenced-by-count":12,"title":["Combining Column Generation and Metaheuristics"],"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":"11_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-16054-7_14","volume-title":"Hybrid Metaheuristics","author":"F. Alvelos","year":"2010","unstructured":"Alvelos, F., de Sousa, A., Santos, D.: SearchCol: Metaheuristic Search by Column Generation. In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds.) HM 2010. LNCS, vol.\u00a06373, pp. 190\u2013205. Springer, Heidelberg (2010)"},{"key":"11_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 International Network Optimization Conference, INOC 2003, Evry\/Paris, pp. 7\u201312 (October 2003)"},{"key":"11_CR4","unstructured":"Alvelos, F., Val\u00e9rio de Carvalho, J.M.: A Local Search Heuristic based on Column Generation Applied to the Binary Multicommodity Flow Problem. In: Proceedings of International Network Optimization Conference, INOC 2007, Spa, Belgium, p. 6 (April 2007)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/opre.47.6.862","volume":"47","author":"J.M. Akker","year":"1999","unstructured":"Akker, J.M., van den 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":"11_CR6","unstructured":"Akker, J.M., van den Hoogeveen, H., van de Velde, S.L.: Appplying column generation to machine scheduling. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, ch. 11, Springer (2005)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.sorms.2010.07.001","volume":"16","author":"M.O. Ball","year":"2006","unstructured":"Ball, M.O.: Heuristics based on mathematical programming. Surveys in Operations Research and Management Science\u00a016, 21\u201338 (2006)","journal-title":"Surveys in Operations Research and Management Science"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C. Barnhart","year":"2000","unstructured":"Barnhart, C., Hane, C.A., Vance, P.H.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research\u00a048, 318\u2013326 (2000)","journal-title":"Operations Research"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Operations Research\u00a046, 316\u2013329 (1998)","journal-title":"Operations Research"},{"key":"11_CR10","unstructured":"Beasley, J.E.: Lagrangian relaxation. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems. John Wiley and Sons (1993)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Blum, C., Aguilera, M.J.B., Roli, A., Sampels, M. (eds.): Hybrid metaheuristics: An emerging approach to optimization. Springer (2008)","DOI":"10.1007\/978-3-540-78295-7"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Blum, C., Cotta, C., Fernandez, A.J., Gallardo, J.E., Mastrolilli, M.: Hybridizations of metaheuristics with branch-and-bound derivatives. In: Blum, C., Aguilera, M.J.B., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics: An Emerging Approach to Optimization. Springer (2008)","DOI":"10.1007\/978-3-540-78295-7_4"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C. Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing\u00a011, 4135\u20134151 (2011)","journal-title":"Applied Soft Computing"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C. Blum","year":"2011","unstructured":"Blum, C., Roli, A.: Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys\u00a035, 268\u2013308 (2011)","journal-title":"ACM Computing Surveys"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Boschetti, M., Maniezzo, V., Roffilli, M.: Decomposition Techniques as Metaheuristic Frameworks. In: Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.) Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, Annals of Information Systems, vol.\u00a010, ch. 5. Springer (2009)","DOI":"10.1007\/978-1-4419-1306-7"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1287\/ijoc.11.1.78","volume":"11","author":"Z.-L. Chen","year":"1999","unstructured":"Chen, Z.-L., Powell, W.B.: Solving Parallel Machine Scheduling Problems by Column Generation. INFORMS Journal on Computing\u00a011, 78\u201394 (1999)","journal-title":"INFORMS Journal on Computing"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0377-2217(94)90074-4","volume":"75","author":"C. Dillenberger","year":"1994","unstructured":"Dillenberger, C., Escudero, L.F., Wollensak, A., Zhang, W.: On Practical Resource Allocation for Production Planning and Scheduling with Period Overlapping Setups. European Journal of Operational Research\u00a075, 275\u2013286 (1994)","journal-title":"European Journal of Operational Research"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Danna, E., Pape, C.L.: Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, ch. 4. Springer (2005)","DOI":"10.1007\/0-387-25486-2_4"},{"key":"11_CR19","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"},{"volume-title":"Column Generation","year":"2005","key":"11_CR20","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.): Column Generation. Springer, New York (2005)"},{"key":"11_CR21","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"},{"key":"11_CR22","doi-asserted-by":"crossref","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, Handbooks in OR & MS, vol.\u00a08, ch. 2. Elsevier Science B.V. (1995)","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1013613701606","volume":"18","author":"T. Fahle","year":"2002","unstructured":"Fahle, T., Junker, U., Karisch, S.E., Kohl, N., Sellmann, M., Vaaben, B.: Constraint Programming Based Column Generation for Crew Assignment. Journal of Heuristics\u00a018, 59\u201381 (2002)","journal-title":"Journal of Heuristics"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Management Science\u00a027, 1\u201318 (1981)","journal-title":"Management Science"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1287\/mnsc.1040.0307","volume":"50","author":"M.L. Fisher","year":"2004","unstructured":"Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Management Science\u00a050, 1872\u20131874 (2004)","journal-title":"Management Science"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"M.L. Fisher","year":"1990","unstructured":"Fisher, M.L., Kedia, P.: Optimal solutions of set covering\/partitioning problems using dual heuristics. Management Science\u00a036, 674\u2013688 (1990)","journal-title":"Management Science"},{"key":"11_CR27","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":"11_CR28","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10479-005-3447-9","volume":"139","author":"A. Frangioni","year":"2005","unstructured":"Frangioni, A.: About Lagrangian Methods in Integer Optimization. Annals of Operations Research\u00a0139, 163\u2013193 (2005)","journal-title":"Annals of Operations Research"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Potvin, J.-Y. (eds.): Handbook of metaheuristics. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"Geoffrion, A.M.: Lagrangean relaxation for integer programming. Mathematical Programming Study\u00a02, 82\u2013114 (1974)","journal-title":"Mathematical Programming Study"},{"key":"11_CR31","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":"11_CR32","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":"11_CR33","doi-asserted-by":"crossref","unstructured":"Glover, F., Kochenberger, G. (eds.): Handbook of metaheuristics. Kluwer (2003)","DOI":"10.1007\/b101874"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer (1997)","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"11_CR35","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10288-009-0101-4","volume":"7","author":"S. Gualandi","year":"2009","unstructured":"Gualandi, S., Malucelli, F.: Constraint programming-based column generation. A Quarterly Journal of Operations\u00a07, 113\u2013137 (2009)","journal-title":"A Quarterly Journal of Operations"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovic, N., Brimberg, J., Perez, J.A.M.: Variable neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_3"},{"key":"11_CR37","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Operations Research\u00a018, 1138\u20131167 (1970)","journal-title":"Operations Research"},{"key":"11_CR38","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: Part II. Mathematical Programming\u00a01, 6\u201325 (1971)","journal-title":"Mathematical Programming"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Hopp, W.J. (Editor-in-Chief): Ten Most Influential Titles of \u201dManagement Science\u2019s\u201d First Fifty Years. Management Science\u00a050 (2004)","DOI":"10.1287\/mnsc.1040.0299"},{"key":"11_CR40","unstructured":"IEEE Standard 802.1s: Virtual Bridged Local Area Networks - Amendment 3: Multiple Spanning Trees (2002)"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.): 50 Years of Integer Programming 1958-2008, From the Early Years to the State-of-the-Art. Springer (2010)","DOI":"10.1007\/978-3-540-68279-0"},{"key":"11_CR42","doi-asserted-by":"crossref","unstructured":"Klabjan, D.: Large-scale models in the airline industry. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, ch. 3, Springer (2005)","DOI":"10.1007\/0-387-25486-2_6"},{"key":"11_CR43","unstructured":"Kallehauge, B., Larsen, J., Madsen, O.B.G.: Vehicle Routing with Time Windows. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, ch. 3. Springer (2005)"},{"key":"11_CR44","first-page":"703","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley, J.E.: The cutting-plane method for solving convex programs. Journal of the SIAM\u00a08, 703\u2013712 (1960)","journal-title":"Journal of the SIAM"},{"key":"11_CR45","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1016\/j.ejor.2005.11.001","volume":"176","author":"M.J.P. Lopes","year":"2007","unstructured":"Lopes, M.J.P., Val\u00e9rio de Carvalho, J.M.: A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. European Journal of Operational Research\u00a0176, 1508\u20131527 (2007)","journal-title":"European Journal of Operational Research"},{"key":"11_CR46","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":"11_CR47","doi-asserted-by":"crossref","unstructured":"Maniezzo, V., Stutzle, T., Voss, S. (eds.): Matheuristics, hybridizing metaheuristics and mathematical programming. Springer (2009)","DOI":"10.1007\/978-1-4419-1306-7"},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"Marti, R., Moreno-Vega, J.M., Duarte, A.: Advanced multi-start methods. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_9"},{"key":"11_CR49","doi-asserted-by":"crossref","unstructured":"Martin, R.K.: Large Scale Linear and Integer Optimization, A Unified Approach. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-1-4615-4975-8"},{"key":"11_CR50","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1287\/ijoc.1040.0089","volume":"18","author":"M. Monaci","year":"2006","unstructured":"Monaci, M., Paolo, T.: 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":"11_CR51","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/00207548808947840","volume":"26","author":"P.S. Ow","year":"1988","unstructured":"Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. International Journal of Production Research\u00a026, 35\u201362 (1988)","journal-title":"International Journal of Production Research"},{"key":"11_CR52","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":"11_CR53","doi-asserted-by":"crossref","unstructured":"Puchinger, J., Raidl, G.R., Pirkwieser, S.: MetaBoosting: enhancing integer programming techniques by metaheuristics. In: Maniezzo, V., Stutzle, T., Voss, S. (eds.) Matheuristics, Hybridizing Metaheuristics and Mathematical Programming. Springer (2009)","DOI":"10.1007\/978-1-4419-1306-7_3"},{"key":"11_CR54","doi-asserted-by":"crossref","unstructured":"Raidl, G.R.: A Unified View on Hybrid Metaheuristics. In: Almeida, F., Aguilera, M.J., Blum, C., Moreno Vega, J.M., Perez, M., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics. Springer (2006)","DOI":"10.1007\/11890584_1"},{"key":"11_CR55","doi-asserted-by":"crossref","unstructured":"Raidl, G.R., Puchinger, J., Blum, C.: Metaheuristic Hybrids. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_16"},{"key":"11_CR56","doi-asserted-by":"crossref","unstructured":"Raidl, G.R., Puchinger, J.: Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. In: Blum, C., Aguilera, M.J.B., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics: An Emerging Approach to Optimization. Springer (2008)","DOI":"10.1007\/978-3-540-78295-7_2"},{"key":"11_CR57","doi-asserted-by":"crossref","unstructured":"Resende, M., Ribeiro, C.: Greedy randomized adaptive search procedures: advances, hybridizations, and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, 2nd edn., ch. 10. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_10"},{"key":"11_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-04576-9_8","volume-title":"Traffic Management and Traffic Engineering for the Future Internet","author":"D. 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., Salvador, P. (eds.) FITraMEn 2008. LNCS, vol.\u00a05464, pp. 114\u2013129. Springer, Heidelberg (2009)"},{"key":"11_CR59","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s11235-010-9337-8","volume":"48","author":"D. Santos","year":"2011","unstructured":"Santos, D., Sousa, A.F., Alvelos, F., Dzida, M., Pi\u00f3ro, M.: Optimization of link load balancing in multiple spanning tree routing networks. Telecommunication Systems\u00a048, 109\u2013124 (2011)","journal-title":"Telecommunication Systems"},{"key":"11_CR60","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":"11_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","volume":"135","author":"E. Taillard","year":"2001","unstructured":"Taillard, E., Gambardella, L., Gendreau, M., Potvin, J.-Y.: Adaptive memory programming: A unified view of metaheuristics. European Journal of Operational Research\u00a0135, 1\u201316 (2001)","journal-title":"European Journal of Operational Research"},{"key":"11_CR62","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"E.-G. Talbi","year":"2002","unstructured":"Talbi, E.-G.: A taxonomy of hybrid metaheuristics. Journal of Heuristics\u00a08, 541\u2013564 (2002)","journal-title":"Journal of Heuristics"},{"key":"11_CR63","doi-asserted-by":"crossref","unstructured":"Talbi, E.-G.: Metaheuristics. John Wiley and Sons (2009)","DOI":"10.1002\/9780470496916"},{"key":"11_CR64","unstructured":"Vanderbeck, F.: Implementing Mixed Integer Column Generation. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, ch. 12, Springer (2005)"},{"key":"11_CR65","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"},{"key":"11_CR66","unstructured":"Wolsey, L.A.: Integer Programming. John Wiley and Sons (1998)"}],"container-title":["Studies in Computational Intelligence","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30671-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:42:48Z","timestamp":1687653768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30671-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642306709","9783642306716"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30671-6_11","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}