{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:28:10Z","timestamp":1774416490264,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T00:00:00Z","timestamp":1193097600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10732-007-9064-9","type":"journal-article","created":{"date-parts":[[2007,10,22]],"date-time":"2007-10-22T19:01:29Z","timestamp":1193079689000},"page":"283-312","source":"Crossref","is-referenced-by-count":53,"title":["Benders decomposition, Lagrangean relaxation and metaheuristic design"],"prefix":"10.1007","volume":"15","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"}]}],"member":"297","published-online":{"date-parts":[[2007,10,23]]},"reference":[{"key":"9064_CR1","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1057\/palgrave.jors.2600621","volume":"49","author":"M. Agar","year":"1998","unstructured":"Agar, M., Salhi, S.: Lagrangean heuristics applied to a variety of large capacitated plant location problems. J. Oper. Res. Soc. 49, 1072\u20131084 (1998)","journal-title":"J. Oper. Res. Soc."},{"key":"9064_CR2","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., Orlin, J.B., Pallottino, S., Scaparra, M.P., Scutell\u00e0, M.G.: A multi-exchange heuristic for the single source capacitated facility location problem. Manag. Sci. 50 (2003)","DOI":"10.2139\/ssrn.337621"},{"key":"9064_CR3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87, 385\u2013399 (2000)","journal-title":"Math. Program."},{"key":"9064_CR4","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0377-2217(84)90211-X","volume":"15","author":"J. Barcelo","year":"1984","unstructured":"Barcelo, J., Casanova, J.: A heuristic Lagrangean algorithm for the capacitated plant location problem. Eur. J. Oper. Res. 15, 212\u2013226 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"9064_CR5","first-page":"243","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"J.E. Beasley","year":"1993","unstructured":"Beasley, J.E.: Lagrangean relaxation. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, pp.\u00a0243\u2013303. Blackwell Scientific, Oxford (1993)"},{"key":"9064_CR6","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 280\u2013322 (1962)","journal-title":"Numer. Math."},{"key":"9064_CR7","unstructured":"Boschetti, M.A., Jelasity, M., Maniezzo, V.: A local approach to membership overlay design. Working paper, Department of Computer Science, University of Bologna (2006)"},{"key":"9064_CR8","unstructured":"Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem. In: Barbarosoglu, G., Karabati, S., Ozdamar, L., Ulusoy, G. (eds.) Proceedings of the Sixth International Workshop on Project Management and Scheduling, pp.\u00a01922. Bogazici University (1998)"},{"key":"9064_CR9","doi-asserted-by":"crossref","unstructured":"Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for a capacitated facility location problem. In: Proc. 10th Annu. ACM-SIAM Sympos. Discrete Algorithms, pp.\u00a0S875\u2013S876 (1999)","DOI":"10.1007\/3-540-48777-8_8"},{"key":"9064_CR10","first-page":"194","volume":"37","author":"H. Delmaire","year":"1999","unstructured":"Delmaire, H., Diaz, J.A., Fernandez, E., Ortega, M.: Reactive grasp and tabu search based heuristics for the single source capacitated plant location problem. INFOR 37, 194\u2013225 (1999)","journal-title":"INFOR"},{"issue":"5","key":"9064_CR11","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1080\/07408179308964317","volume":"25","author":"A. Drexl","year":"1993","unstructured":"Drexl, A., Grunewald, J.: Nonpreemptive multi-mode resource-constrained project scheduling. IIE Trans. 25(5), 74\u201381 (1993)","journal-title":"IIE Trans."},{"key":"9064_CR12","volume-title":"Activity Networks: Project Planning and Control by network Models","author":"S.E. Elmaghraby","year":"1977","unstructured":"Elmaghraby, S.E.: Activity Networks: Project Planning and Control by network Models. Wiley, New York (1977)"},{"key":"9064_CR13","doi-asserted-by":"crossref","unstructured":"Ganesh, A.J., Kermarrec, A.-M., Massouli\u00e9, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Comput. 52(2) (February 2003)","DOI":"10.1109\/TC.2003.1176982"},{"key":"9064_CR14","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"key":"9064_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Boston (1997)"},{"key":"9064_CR16","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1010902015091","volume":"102","author":"S. Hartmann","year":"2001","unstructured":"Hartmann, S.: Project scheduling with multiple modes: a genetic algorithm. Ann. Oper. Res. 102, 111\u2013135 (2001)","journal-title":"Ann. Oper. Res."},{"key":"9064_CR17","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","volume":"113","author":"K. Holmberg","year":"1999","unstructured":"Holmberg, K., Ronnqvist, M., Yuan, D.: An exact algorithm for the capacitated facility location problems with single sourcing. Eur. J. Oper. Res. 113, 544\u2013559 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"9064_CR18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0377-2217(98)00045-9","volume":"116","author":"J. Holt","year":"1999","unstructured":"Holt, J., Ronnqvist, M., Tragantalerngsak, S.: A repeated matching heuristic for the single source capacitated facility location problem. Eur. J. Oper. Res. 116, 51\u201368 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"9064_CR19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1010954031930","volume":"102","author":"J. Jozefowska","year":"2001","unstructured":"Jozefowska, J., Mika, M., Royzycki, R., Waligora, G., Weglarz, J.: Simulated annealing for multi-mode resource-constrained project scheduling. Ann. Oper. Res. 102, 137\u2013155 (2001)","journal-title":"Ann. Oper. Res."},{"key":"9064_CR20","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1057\/jors.1986.84","volume":"37","author":"J. Klincewicz","year":"1986","unstructured":"Klincewicz, J., Luss, H.: A Lagrangean relaxation heuristic for capacitated facility location with single-source constraints. J. Oper. Res. Soc. 37, 495\u2013500 (1986)","journal-title":"J. Oper. Res. Soc."},{"key":"9064_CR21","unstructured":"Kolisch, R., Drexl, A.: Local search for nonpreemptive multi-mode resource constrained project scheduling. Technical Report 360, Institut fr Betriebswirtschaftslehre, Christian-Albrechts-Universitt zu Kiel, Kiel (1994)"},{"key":"9064_CR22","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","volume":"41","author":"R. Kolisch","year":"1995","unstructured":"Kolisch, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resource constrained project scheduling problems. Manag. Sci. 41, 1693\u20131703 (1995)","journal-title":"Manag. Sci."},{"key":"9064_CR23","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/978-1-4615-5533-9_8","volume-title":"Project Scheduling: Recent Models, Algorithms and Applications","author":"V. Maniezzo","year":"1999","unstructured":"Maniezzo, V., Mingozzi, A.: A heuristic procedure for the multi-mode project scheduling problem based on benders decomposition. In: Weglarz, J. (ed.) Project Scheduling: Recent Models, Algorithms and Applications, pp.\u00a0179\u2013196. Kluwer Academic, Dordrecht (1999)"},{"key":"9064_CR24","series-title":"Lecture Notes in Computer Science","first-page":"3748","volume-title":"Ant Colony, Optimization and Swarm Intelligence: Proc. ANTS 2004","author":"V. Maniezzo","year":"2004","unstructured":"Maniezzo, V., Boschetti, M.A., Jelasity, M.: An ant approach to membership overlay design. In: Ant Colony, Optimization and Swarm Intelligence: Proc. ANTS 2004. Lecture Notes in Computer Science, vol.\u00a03172, p.\u00a03748. Springer, Berlin (2004)"},{"key":"9064_CR25","unstructured":"Maniezzo, V., Boschetti, M.A., Jelasity, M.: 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":"9064_CR26","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)"},{"key":"9064_CR27","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A. Mingozzi","year":"1998","unstructured":"Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L.: An exact algorithm for the resource constrained project scheduling problem based on a new mathematical formulation. Manag. Sci. 44, 715\u2013729 (1998)","journal-title":"Manag. Sci."},{"key":"9064_CR28","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1057\/jors.1983.242","volume":"34","author":"A. Neebe","year":"1983","unstructured":"Neebe, A., Rao, M.: An algorithm for the fixed-charge assigning users to sources problem. J. Oper. Res. Soc. 34, 1107\u20131113 (1983)","journal-title":"J. Oper. Res. Soc."},{"key":"9064_CR29","unstructured":"Peersim: A peer-to-peer simulator, http:\/\/peersim.sourceforge.net\/ (2006)"},{"key":"9064_CR30","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","volume":"14","author":"H. Pirkul","year":"1987","unstructured":"Pirkul, H.: Efficient algorithm for the capacitated concentrator location problem. Comput. Oper. Res. 14, 197\u2013208 (1987)","journal-title":"Comput. Oper. Res."},{"key":"9064_CR31","unstructured":"Planetlab: An open platform for developing, deploying, and accessing planetary-scale services, http:\/\/www.planet-lab.org\/ (2006)"},{"key":"9064_CR32","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"B.T. Polyak","year":"1969","unstructured":"Polyak, B.T.: Minimization of unsmooth functionals. USSR Comput. Math. Phys. 9, 14\u201329 (1969)","journal-title":"USSR Comput. Math. Phys."},{"key":"9064_CR33","doi-asserted-by":"crossref","unstructured":"Saroiu, S., Krishna Gummadi, P., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Computing and Networking 2002 (MMCN\u201902), San Jose, CA (2002)","DOI":"10.1117\/12.449977"},{"key":"9064_CR34","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0167-6377(96)00019-3","volume":"19","author":"H.D. Sherali","year":"1996","unstructured":"Sherali, H.D., Choi, G.: Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of liner programs. Oper. Res. Lett. 19, 105\u2013113 (1996)","journal-title":"Oper. Res. Lett."},{"key":"9064_CR35","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. Solomon","year":"1987","unstructured":"Solomon, M.: Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 35, 254\u2013365 (1987)","journal-title":"Oper. Res."},{"key":"9064_CR36","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/S0377-2217(97)00348-2","volume":"107","author":"A. Sprecher","year":"1998","unstructured":"Sprecher, A., Drexl, A.: Solving multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. Eur. J. Oper. Res. 107, 431\u2013450 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9064_CR37","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0377-2217(93)90219-D","volume":"66","author":"R. Sridharan","year":"1991","unstructured":"Sridharan, R.: A Lagrangian heuristic for the capacitated plant location problem with single source constraints. Eur. J. Oper. Res. 66, 305\u2013312 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"9064_CR38","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","volume":"28","author":"B. Talbot","year":"1982","unstructured":"Talbot, B.: Resource-constrained project scheduling with time-resource tradeoffs: the nonpreemptive case. Manag. Sci. 28, 1197\u20131210 (1982)","journal-title":"Manag. Sci."},{"key":"9064_CR39","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1080\/00207549408956961","volume":"32","author":"G. Ulusoy","year":"1994","unstructured":"Ulusoy, G., Ozdamar, L.: A constraint-based perspective in resource constrained project scheduling. Int. J. Prod. Res. 32, 693\u2013705 (1994)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"9064_CR40","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.34.1.145","volume":"34","author":"T.J. Roy van","year":"1986","unstructured":"van Roy, T.J.: A cross decomposition algorithm for capacitated facility location. Oper. Res. 34(1), 145\u2013163 (1986)","journal-title":"Oper. Res."},{"key":"9064_CR41","series-title":"LNAI","first-page":"1","volume-title":"Local Search for Planning and Scheduling","author":"S. Voss","year":"2001","unstructured":"Voss, S.: Meta-heuristics: The state of the art. In: Nareyek, A. (ed.) Local Search for Planning and Scheduling. LNAI, vol.\u00a02148, pp.\u00a01\u201323. Springer, Berlin (2001)"},{"key":"9064_CR42","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1111\/j.1467-8667.2005.00420.x","volume":"21","author":"H. Zhang","year":"2006","unstructured":"Zhang, H., Tam, C.M., Li, H.: Multimode project scheduling based on particle swarm optimization. Comput. Aided Civ. Infrastruct. Eng. 21, 93\u2013103 (2006)","journal-title":"Comput. Aided Civ. Infrastruct. Eng."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9064-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-007-9064-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9064-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:29Z","timestamp":1559256869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-007-9064-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,23]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9064"],"URL":"https:\/\/doi.org\/10.1007\/s10732-007-9064-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,23]]}}}