{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:33:13Z","timestamp":1743114793531,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":32,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781441913050"},{"type":"electronic","value":"9781441913067"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-1-4419-1306-7_5","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T18:32:39Z","timestamp":1252953159000},"page":"135-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Decomposition Techniques as Metaheuristic Frameworks"],"prefix":"10.1007","author":[{"given":"Marco","family":"Boschetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vittorio","family":"Maniezzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Roffilli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,1]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1057\/palgrave.jors.2600621","volume":"49","author":"M. Agar","year":"1998","unstructured":"M. Agar and S. Salhi. Lagrangean heuristics applied to a variety of large capacitated plant location problems. Journal of the Operational Research Society, 49:1072\u20131084, 1998.","journal-title":"Journal of the Operational Research Society"},{"key":"5_CR2","first-page":"749","volume":"6","author":"R.K. Ahuja","year":"2003","unstructured":"R.K. Ahuja, J.B. Orlin, S. Pallottino, M.P. Scaparra, and M.G. Scutell\u00e0. A multi-exchange heuristic for the single source capacitated facility location problem. Management Science, (6):749\u2013760, 2003.","journal-title":"Management Science"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF00127080","volume":"1","author":"A. Atamt\u00fcrk","year":"1996","unstructured":"A. Atamt\u00fcrk, G. Nemhauser, and M.W.P. Savelsbergh. A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems. Journal of Heuristics, 1:247\u2013259, 1996.","journal-title":"Journal of Heuristics"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"F. Barahona and R. Anbil. The volume algorithm: producing primal solutions with a subgradient method. Mathematical Programming, 87:385\u2013399, 2000.","journal-title":"Mathematical Programming"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/0377-2217(84)90211-X","volume":"15","author":"J. Barcelo","year":"1984","unstructured":"J. Barcelo and J. Casanovas. A heuristic Lagrangean algorithm for the capacitated plant location problem. European Journal of Operational Research, 15:212\u2013226, 1984.","journal-title":"European Journal of Operational Research"},{"key":"5_CR6","unstructured":"M.S. Bazaraa, J. Jarvis, and H.D. Sherali. Linear Programming and Network Flows. John Wiley & Sons, 1990."},{"key":"5_CR7","unstructured":"J.E. Beasley. Lagrangean relaxation. In C.R. Reeves, editor, Modern heuristic techniques for combinatorial problems, pages 243\u2013303. Blackwell Scientific Publ., 1993."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"J.F. Benders. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4:280\u2013322, 1962.","journal-title":"Numerische Mathematik"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10732-007-9064-9","volume":"15","author":"M.A. Boschetti","year":"2009","unstructured":"M.A. Boschetti and V. Maniezzo. Benders decomposition, Lagrangean relaxation and metaheuristic design. Journal of Heuristics, 15(3):283\u2013312, 2009.","journal-title":"Journal of Heuristics"},{"key":"5_CR10","unstructured":"M.A. Boschetti, V. Maniezzo, and M. Roffilli. A fully distributed Lagrangean solution for a P2P overlay network design problem. Submitted for publication, 2009."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1023\/B:ANOR.0000019089.86834.91","volume":"127","author":"M.A. Boschetti","year":"2004","unstructured":"M.A. Boschetti, A. Mingozzi, and S. Ricciardelli. An exact algorithm for the simplified multi depot crew scheduling problem. Annals of Operations Research, 127:177\u2013201, 2004.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1016\/j.disopt.2008.06.001","volume":"5","author":"M.A. Boschetti","year":"2008","unstructured":"M.A. Boschetti, A. Mingozzi, and S. Ricciardelli. A dual ascent procedure for the set partitioning problem. Discrete Optimization, 5(4):735\u2013747, 2008.","journal-title":"Discrete Optimization"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A. Caprara","year":"1999","unstructured":"A. Caprara, M. Fischetti, and P. Toth. A heuristic method for the set covering problem. Operations Research, 47:730\u2013743, 1999.","journal-title":"Operations Research"},{"key":"5_CR14","first-page":"215","volume":"81","author":"S. Ceria","year":"1995","unstructured":"S. Ceria, P. Nobili, and A. Sassano. A Lagrangian-based heuristic for large-scale set covering problems. Mathematical Programming, 81:215\u2013228, 1995.","journal-title":"Mathematical Programming"},{"key":"5_CR15","unstructured":"F.A. Chudak and D.B. Shmoys. Improved approximation algorithms for a capacitated facility location problem. In Proc. 10th Annu. ACM-SIAM Sympos. Discrete Algorithms, pages S875\u2013S876, 1999."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"G.B. Dantzig and P. Wolfe. Decomposition principle for linear programs. Operations Research, 8:101\u2013111, 1960.","journal-title":"Operations Research"},{"key":"5_CR17","first-page":"194","volume":"37","author":"H. Delmaire","year":"1999","unstructured":"H. Delmaire, J.A. Diaz, E. Fernandez, and M. Ortega. Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem. INFOR, 37:194\u2013225, 1999.","journal-title":"INFOR"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1022287504028","volume":"6","author":"R. Freling","year":"2003","unstructured":"R. Freling, D. Huisman, and A.P.M. Wagelmans. Models and algorithms for integration of vehicle and crew scheduling. Journal of Scheduling, 6:63\u201385, 2003.","journal-title":"Journal of Scheduling"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"K.L. Hoffman","year":"1993","unstructured":"K.L. Hoffman and M. Padberg. Solving airline crew scheduling problems by branch-and-cut. Management Science, 39:657\u2013682, 1993.","journal-title":"Management Science"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","volume":"113","author":"K. Holmberg","year":"1999","unstructured":"K. Holmberg, M. Ronnqvist, and D. Yuan. An exact algorithm for the capacitated facility location problems with single sourcing. European Journal of Operational Research, 113:544\u2013559, 1999.","journal-title":"European Journal of Operational Research"},{"key":"5_CR21","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1057\/jors.1986.84","volume":"37","author":"J. Klincewicz","year":"1986","unstructured":"J. Klincewicz and H. Luss. A Lagrangean relaxation heuristic for capacitated facility location with single-source constraints. Journal of the Operational Research Society, 37:495\u2013500, 1986.","journal-title":"Journal of the Operational Research Society"},{"key":"5_CR22","unstructured":"V. Maniezzo, M.A. Boschetti, and M. Jelasity. A fully distributed Lagrangean metaheuristic for a P2P overlay network design problem. In Proceedings of the 6th Metaheuristics International Conference (MIC 2005), Vienna, Austria, 2005."},{"key":"5_CR23","unstructured":"S. Martello and P. Toth. Knapsack Problems: Algorithms and Computer implementations. John Wiley, 1990."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1287\/opre.47.6.873","volume":"47","author":"A. Mingozzi","year":"1999","unstructured":"A. Mingozzi, M.A. Boschetti, S. Ricciardelli, and L. Bianco. A set partitioning approach to the crew scheduling problem. Operations Research, 47:873\u2013888, 1999.","journal-title":"Operations Research"},{"key":"5_CR25","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1057\/jors.1983.242","volume":"34","author":"A. Neebe","year":"1983","unstructured":"A. Neebe and M. Rao. An algorithm for the fixed-charge assigning users to sources problem. Journal of the Operational Research Society, 34:1107\u20131113, 1983.","journal-title":"Journal of the Operational Research Society"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","volume":"14","author":"H. Pirkul","year":"1987","unstructured":"H. Pirkul. Efficient algorithm for the capacitated concentrator location problem. Computers & Operations Research, 14:197\u2013208, 1987.","journal-title":"Computers & Operations Research"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"B.T. Polyak","year":"1969","unstructured":"B.T. Polyak. Minimization of unsmooth functionals. USSR Computational Mathematics and Mathematical Physics, 9:14\u201329, 1969.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0377-2217(98)00045-9","volume":"116","author":"M. Ronnqvist","year":"1999","unstructured":"M. Ronnqvist, S. Tragantalerngsak, and J. Holt. A repeated matching heuristic for the single source capacitated facility location problem. European Journal of Operational Research, 116:51\u201368, 1999.","journal-title":"European Journal of Operational Research"},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0167-6377(96)00019-3","volume":"19","author":"H.D. Sherali","year":"1996","unstructured":"H.D. Sherali and G. Choi. Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs. Operations Research Letters, 19:105\u2013113,1996.","journal-title":"Operations Research Letters"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. Solomon","year":"1987","unstructured":"M. Solomon. Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research, 35:254\u2013365, 1987.","journal-title":"Operations Research"},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0377-2217(93)90219-D","volume":"66","author":"R. Sridharan","year":"1991","unstructured":"R. Sridharan. A Lagrangian heuristic for the capacitated plant location problem with single source constraints. European Journal of Operational Research, 66:305\u2013312, 1991.","journal-title":"European Journal of Operational Research"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"M.G.C. Van Krieken, H. Fleuren, and R. Peeters. A Lagrangean relaxation based algorithm for solving set partitioning problems. Technical Report 2004-44, CentER Discussion Paper, 2004.","DOI":"10.2139\/ssrn.557848"}],"container-title":["Annals of Information Systems","Matheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-1306-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T20:38:49Z","timestamp":1674074329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-1306-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9781441913050","9781441913067"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-1306-7_5","relation":{},"ISSN":["1934-3221","1934-3213"],"issn-type":[{"type":"print","value":"1934-3221"},{"type":"electronic","value":"1934-3213"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"1 September 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}