{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:49:37Z","timestamp":1759837777267},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1007\/s10479-005-2451-4","type":"journal-article","created":{"date-parts":[[2005,8,30]],"date-time":"2005-08-30T02:51:26Z","timestamp":1125370286000},"page":"159-178","source":"Crossref","is-referenced-by-count":19,"title":["Scatter Search for Network Design Problem"],"prefix":"10.1007","volume":"138","author":[{"given":"Ada M.","family":"Alvarez","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Luis","family":"Gonz\u00e1lez-Velarde","sequence":"additional","affiliation":[]},{"given":"Karim","family":"De-Alba","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2451_CR1","unstructured":"Alvarez, A., J.L. Gonz\u00e1lez-Velarde, and K. De Alba. (2001). \u201cScatter Search for the Multicommodity Capacited Network Design Problem.\u201d In Proceedings of 6th Annual International Conference on Industrial Engineering\u2014Theory, Aplications and Practice. San Francisco, CA, USA."},{"issue":"5","key":"2451_CR2","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A. Balakrishnan","year":"1989","unstructured":"Balakrishnan A. and T.L. Magnanti. (1989). \u201cA Dual Ascent Procedure for Large-Scale Uncapacitated Network Design.\u201d Operations Research 37(5), 716\u2013740.","journal-title":"Operations Research"},{"key":"2451_CR3","first-page":"331","volume-title":"New Ideas in Optimization","author":"V. Campos","year":"1999","unstructured":"Campos V., M. Laguna, and R. Mart\u00ed. (1999). \u201cScatter Search for the Linear Ordering Problem.\u201d In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. New York, USA: McGraw-Hill. pp. 331\u2013339."},{"key":"2451_CR4","unstructured":"CPLEX Optimization, Inc. (1999). ILOG CPLEX 7.1 Reference Manual. Incline Village, NV, USA."},{"issue":"2","key":"2451_CR5","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(99)00233-7","volume":"122","author":"T.G. Crainic","year":"2000","unstructured":"Crainic, T.G. (2000). \u201cService Network Design in Freight Transportation.\u201d European Journal of Operational Research 122(2), 272\u2013288.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2451_CR6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/ijoc.12.3.223.12638","volume":"12","author":"T.G. Crainic","year":"2000","unstructured":"Crainic, T.G., M. Gendreau, and J. Farvolden. (2000). \u201cA Simplex-Based Tabu Search Method for Capacitated Network Design.\u201d INFORMS Journal on Computing 12(3), 223\u2013236.","journal-title":"INFORMS Journal on Computing"},{"key":"2451_CR7","unstructured":"Cobos, N. (To appear), Tabu Search-Based Algorithm for the Capacitated Network Design Problem. Master in Science Thesis. Universidad Aut\u00f3noma de Nuevo Le\u00f3n, Monterrey, N.L. Mexico."},{"key":"2451_CR8","doi-asserted-by":"crossref","unstructured":"De Alba, K., A. Alvarez, and J.L. Gonz\u00e1lez-Velarde. (2003). \u201cGrasp with Adaptive Memory Programming for Finding Good Starting Solutions to the Multicommodity Capacitated Network Design Problem.\u201d In H.K. Bhargava and N. Ye (eds.), Computational Modeling and Problem Solving in the Networked World. Interfaces in Computer Science and Operations Research. Kluwer, pp. 121\u2013137.","DOI":"10.1007\/978-1-4615-1043-7_6"},{"issue":"2","key":"2451_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A. and M.G.C. Resende. (1995). \u201cGreedy Randomized Adaptive Search Procedures.\u201d Journal of Global Optimization 6(2), 109\u2013133.","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"2451_CR10","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C. Fleurent","year":"1999","unstructured":"Fleurent, C. and F. Glover. (1999). \u201cImproved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory.\u201d INFORMS Journal on Computing 11(2), 198\u2013204.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"2451_CR11","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/S0377-2217(01)00110-2","volume":"138","author":"B. Gendron","year":"2002","unstructured":"Gendron, B. (2002). A Note on \u201cA Dual-Ascent Approach to the Fixed-Charge Capacitated Network Design Problems.\u201d European Journal of Operational Research 138(3), 671\u2013675.","journal-title":"European Journal of Operational Research"},{"key":"2451_CR12","unstructured":"Gendron, B. and T.G. Crainic (1996). \u201cBounding Procedures for Multicommodity Capacitated Fixed Charge Network Design Problems. CRT-96-06. Centre de Recherche sur le Transport, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada, January."},{"key":"2451_CR13","unstructured":"Gendron, B. and T.G. Crainic. (1994a). \u201cParallel Implementations of Bounding Procedures for Multicommodity Capacitated Network Design Problems.\u201d CRT-94-45. Centre de Recherche sur le Transport, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada, September."},{"key":"2451_CR14","unstructured":"Gendron, B. and T.G. Crainic. (1994b). \u201cRelaxations for Multicommodity Capacitated Network Design Problems.\u201d CRT-965. Centre de Recherche sur le Transport, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada, February."},{"key":"2451_CR15","doi-asserted-by":"crossref","unstructured":"Glover, F. (1998). \u201cA Template for Scatter Search and Path Relinking.\u201d In J.K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers (eds.), Artificial Evolution: Third European Conference, Lecture Notes in Computer Science, Springer-Verlag Heidelberg, Heidelberg, Germany, Vol. 1363, pp. 13\u201354.","DOI":"10.1007\/BFb0026589"},{"issue":"4","key":"2451_CR16","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1016\/0377-2217(95)00305-3","volume":"95","author":"J.W. Herrmann","year":"1996","unstructured":"Herrmann, J.W., G. Ioannou, I. Minis, and J.M. Proth. (1996). \u201cA Dual Ascent Approach to the Fixed-Charge Capacitated Network Design Problem.\u201d European Journal of Operational Research 95(4), 476\u2013490.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2451_CR17","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.46.2.247","volume":"46","author":"K. Holmberg","year":"1998","unstructured":"Holmberg, K. and J. Hellstrand. (1998). \u201cSolving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound.\u201d Operations Research 46(2), 247\u2013258.","journal-title":"Operations Research"},{"issue":"3","key":"2451_CR18","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K. Holmberg","year":"2000","unstructured":"Holmberg, K. and D. Yuan. (2000). \u201cA Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem.\u201d Operations Research 48(3), 461\u2013481.","journal-title":"Operations Research"},{"key":"2451_CR19","unstructured":"Laguna, M. (2002). \u201cScatter Search.\u201d In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization, Oxford Academic Press pp. 183\u2013193."},{"key":"2451_CR20","unstructured":"Laguna, M. and V.A. Armentano. (2004). \u201cLessons from Applying and Experimenting with Scatter Search.\u201d In C. Rego and A. Bahram (eds.), Adaptive Memory and Evolution: Tabu Search and Scatter Search (to appear)."},{"key":"2451_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter Seach Metodology and Implemetations in C","author":"M. Laguna","year":"2003","unstructured":"Laguna, M. and R. Mart\u00ed. (2003). \u201cScatter Seach Metodology and Implemetations in C.\u201d Boston, USA: Kluwer."},{"key":"2451_CR22","first-page":"633","volume-title":"CP 2002","author":"L.P. Le Pape","year":"2002","unstructured":"Le Pape, L.P., J. R\u00e9gin, and P. Shaw. (2002). \u201cRobust and Parallel Solving of a Network Design Problem.\u201d In P. Van Hentenryck (ed.), CP 2002, LNCS 2470, Germany: Springer, Heidelberg, pp. 633\u2013648."},{"key":"2451_CR23","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0121090","volume":"26","author":"T. Magnanti","year":"1986","unstructured":"Magnanti, T., P. Mireault, and R. Wong. (1986). \u201cTailoring Benders Decomposition for Uncapacitated Network Design.\u201d Mathematical Programming Study 26, 112\u2013154.","journal-title":"Mathematical Programming Study"},{"issue":"1","key":"2451_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T. Magnanti","year":"1984","unstructured":"Magnanti, T. and R. Wong. (1984). \u201cNetwork Design and Transportation Planning: Models and Algorithms.\u201d Transportation Science 18(1), 1\u201355.","journal-title":"Transportation Science"},{"key":"2451_CR25","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-1-4615-4567-5_12","volume-title":"Computing Tools for Modeling Optimization and Simulation: Interfaces in Computer Science and Operations Research","author":"R. Mart\u00ed","year":"2000","unstructured":"Mart\u00ed, R., H. Louren\u00e7o, and M. Laguna. (2000). \u201cAssigning Proctors to Exams with Scatter Search.\u201d In M.Y. Laguna, J.L. Gonz\u00e1lez-Velarde (eds.), Computing Tools for Modeling Optimization and Simulation: Interfaces in Computer Science and Operations Research. Boston, USA: Kluwer, pp. 215\u2013227."},{"issue":"3","key":"2451_CR26","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1016\/S0377-2217(99)00272-6","volume":"125","author":"V. Sridhar","year":"2000","unstructured":"Sridhar, V. and J.S. Park. (2000). \u201cBenders-and-Cut Algorithm for Fixed-Charge Capacitated Network Design Problem.\u201d European Journal of Operational Research 125(3), 622\u2013632.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2451-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-2451-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2451-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:59:34Z","timestamp":1559152774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-2451-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["2451"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-2451-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}