{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T06:34:37Z","timestamp":1697870077202},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,3,23]],"date-time":"2010-03-23T00:00:00Z","timestamp":1269302400000},"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":[[2011,4]]},"DOI":"10.1007\/s10732-010-9130-6","type":"journal-article","created":{"date-parts":[[2010,3,22]],"date-time":"2010-03-22T16:09:37Z","timestamp":1269274177000},"page":"153-179","source":"Crossref","is-referenced-by-count":13,"title":["Adaptive memory in multistart heuristics for\u00a0multicommodity network design"],"prefix":"10.1007","volume":"17","author":[{"given":"Daniel","family":"Aloise","sequence":"first","affiliation":[]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,23]]},"reference":[{"key":"9130_CR1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R. Ahuja","year":"2002","unstructured":"Ahuja, R., Ergun, O., Orlin, J., Punnen, A.: A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123, 75\u2013102 (2002)","journal-title":"Discrete Appl. Math."},{"key":"9130_CR2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"R.M. Aiex","year":"2002","unstructured":"Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: an experimental investigation. J. Heuristics 8, 343\u2013373 (2002)","journal-title":"J. Heuristics"},{"key":"9130_CR3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"R.M. Aiex","year":"2007","unstructured":"Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: TTTPLOTS: a Perl program to create time-to-target plots. Opt. Lett. 1, 355\u2013366 (2007)","journal-title":"Opt. Lett."},{"key":"9130_CR4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/A:1013867331662","volume":"22","author":"L.T.H. An","year":"2002","unstructured":"An, L.T.H., Tao, P.D.: D.C. programming approach for multicommodity network optimization problems with step increasing cost functions. J. Glob. Optim. 22, 205\u2013232 (2002)","journal-title":"J. Glob. Optim."},{"key":"9130_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s11235-008-9068-2","volume":"36","author":"C.F. Bazlama\u00e7ci","year":"2007","unstructured":"Bazlama\u00e7ci, C.F., Say, F.: Minimum concave cost multicommodity network design. Telecommun. Syst. 36, 181\u2013203 (2007)","journal-title":"Telecommun. Syst."},{"key":"9130_CR6","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1009679511137","volume":"6","author":"D. Berger","year":"2000","unstructured":"Berger, D., Gendron, B., Potvin, J.-Y., Raghavan, S., Soriano, P.: Tabu search for a network loading problem with multiple facilities. J. Heuristics 6, 253\u2013267 (2000)","journal-title":"J. Heuristics"},{"key":"9130_CR7","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"B. Cherkassky","year":"1997","unstructured":"Cherkassky, B., Goldberg, A.: On implementing Push-Relabel method for the maximum flow problem. Algorithmica 19, 390\u2013410 (1997)","journal-title":"Algorithmica"},{"key":"9130_CR8","first-page":"44","volume-title":"Lecture Notes in Computer Science","author":"S. Chopra","year":"1996","unstructured":"Chopra, S., Gilboa, I., Sastry, S.: Algorithms and extended formulations for one and two facility network design. In: Lecture Notes in Computer Science, vol. 1084, pp. 44\u201357. Springer, Berlin (1996)"},{"key":"9130_CR9","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C. Fleurent","year":"1999","unstructured":"Fleurent, C., Glover, F.: Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J. Comput. 11, 198\u2013204 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9130_CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230030202","volume":"3","author":"L. Fratta","year":"1973","unstructured":"Fratta, L., Gerla, M., Kleinrock, L.: The flow-deviation method: an approach to store-and-forward communication network design. Networks 3, 97\u2013133 (1973)","journal-title":"Networks"},{"key":"9130_CR11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0167-6377(99)00020-6","volume":"25","author":"V. Gabrel","year":"1999","unstructured":"Gabrel, V., Knippel, A., Minoux, M.: Exact solution of multicommodity network optimization problems with general step cost functions. Oper. Res. Lett. 25, 15\u201323 (1999)","journal-title":"Oper. Res. Lett."},{"key":"9130_CR12","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1023\/B:HEUR.0000004812.23590.a2","volume":"9","author":"V. Gabrel","year":"2003","unstructured":"Gabrel, V., Knippel, A., Minoux, M.: A comparison of heuristics for the discrete cost multicommodity network optimization problem. J. Heuristics 9, 429\u2013445 (2003)","journal-title":"J. Heuristics"},{"key":"9130_CR13","first-page":"123","volume":"22","author":"V. Gabrel","year":"1997","unstructured":"Gabrel, V., Minoux, M.: LP relaxations better than convexification for multicommodity networks optimization problems with step increasing cost functions. Acta Math. Vietnam. 22, 123\u2013145 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"9130_CR14","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"5","author":"G. Geoffrion","year":"1974","unstructured":"Geoffrion, G., Graves, G.: Multicommodity distribution system design by Benders decomposition. Manag. Sci. 5, 822\u2013844 (1974)","journal-title":"Manag. Sci."},{"key":"9130_CR15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/B:ANOR.0000039515.90453.1d","volume":"131","author":"I. Ghamlouche","year":"2004","unstructured":"Ghamlouche, I., Crainic, T., Gendreau, M.: Path-relinking, cycle-based neighborhoods and capacitated multicommodity network design. Ann. Oper. Res. 131, 109\u2013133 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9130_CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(94)90211-9","volume":"49","author":"F. Glover","year":"1992","unstructured":"Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problem. Discrete Appl. Math. 49, 231\u2013255 (1992)","journal-title":"Discrete Appl. Math."},{"key":"9130_CR17","first-page":"1","volume-title":"Interfaces in Computer Science and Operations Research","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Tabu search and adaptive memory programming\u2014advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1\u201375. Kluwer Academic, Norwell (1996)"},{"key":"9130_CR18","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, Norwell (1997)"},{"key":"9130_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1995.0805","volume":"22","author":"A. Goldberg","year":"1997","unstructured":"Goldberg, A.: An efficient implementation of a scaling minimum-cost flow algorithm. J. Algorithms 22, 1\u201329 (1997)","journal-title":"J. Algorithms"},{"key":"9130_CR20","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9130_CR21","volume-title":"The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling","author":"R. Jain","year":"1991","unstructured":"Jain, R.: The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling. Wiley, New York (1991)"},{"key":"9130_CR22","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/opre.26.2.209","volume":"26","author":"J. Kennington","year":"1978","unstructured":"Kennington, J.: A survey of linear cost multicommodity network flows. Oper. Res. 26, 209\u2013236 (1978)","journal-title":"Oper. Res."},{"key":"9130_CR23","unstructured":"Knippel, A.: Mod\u00e8les et algorithmes de\u00a0multiflots \u00e0 cout discontinu pour l\u2019optimisation de\u00a0r\u00e9seau de\u00a0t\u00e9l\u00e9communications. PhD thesis, Universit\u00e9 Paris VI (2001)"},{"key":"9130_CR24","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1016\/S0305-0548(98)00104-X","volume":"26","author":"M. Laguna","year":"1999","unstructured":"Laguna, M., Mart\u00ed, R., Campos, V.: Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput. Oper. Res. 26, 1217\u20131230 (1999)","journal-title":"Comput. Oper. Res."},{"key":"9130_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T. Magnanti","year":"1984","unstructured":"Magnanti, T., Wong, R.: Network design and transportation planning-models and algorithms. Transp. Sci. 18, 1\u201355 (1984)","journal-title":"Transp. Sci."},{"key":"9130_CR26","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/(SICI)1097-0037(199807)31:4<227::AID-NET3>3.0.CO;2-F","volume":"31","author":"P. Mahey","year":"1998","unstructured":"Mahey, P., Ouorou, A., LeBlanc, L., Chifflet, J.: A new proximal decomposition algorithm for routing in telecommunication networks. Networks 31, 227\u2013238 (1998)","journal-title":"Networks"},{"key":"9130_CR27","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0305-0548(03)00011-X","volume":"31","author":"B. Meli\u00e1n","year":"2004","unstructured":"Meli\u00e1n, B., Laguna, M., Moreno-P\u00e9rez, J.A.: Capacity expansion of fiber optic networks with WDM systems: problem formulation and comparative analysis. Comput. Oper. Res. 31, 461\u2013472 (2004)","journal-title":"Comput. Oper. Res."},{"key":"9130_CR28","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"Minoux, M.: Network synthesis and optimum network design problems: models, solution methods and applications. Networks 19, 313\u2013360 (1989)","journal-title":"Networks"},{"key":"9130_CR29","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1023\/A:1014554606793","volume":"106","author":"M. Minoux","year":"2001","unstructured":"Minoux, M.: Discrete cost multicommodity network optimization problems and exact solution methods. Ann. Oper. Res. 106, 19\u201346 (2001)","journal-title":"Ann. Oper. Res."},{"key":"9130_CR30","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1016\/j.amc.2008.07.031","volume":"204","author":"M. Mrad","year":"2008","unstructured":"Mrad, M., Haouari, M.: Optimal solution of the discrete cost multicommodity network design problem. Appl. Math. Comput. 204, 745\u2013753 (2008)","journal-title":"Appl. Math. Comput."},{"key":"9130_CR31","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/0-387-25383-1_2","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"M.G.C. Resende","year":"2005","unstructured":"Resende, M.G.C., Ribeiro, C.C.: GRASP with path-relinking: recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp.\u00a029\u201363. Kluwer Academic, Norwell (2005)"},{"key":"9130_CR32","unstructured":"Ribeiro, C.C.: Approximate algorithms for the automatic planning of power transmission systems (in Portuguese). Master\u2019s thesis, COPPE, Universidade Federal do Rio de Janeiro (1978)"},{"key":"9130_CR33","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"C.C. Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J. Comput. 14, 228\u2013246 (2002)","journal-title":"INFORMS J. Comput."},{"key":"9130_CR34","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, \u00c9.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147\u2013167 (1995)","journal-title":"J. Heuristics"},{"key":"9130_CR35","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/978-1-4615-5775-3_33","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"E. Rolland","year":"1999","unstructured":"Rolland, E., Patterson, R.A., Pirkul, H.: Memory adaptive reasoning and greedy assignment techniques for the CSMT. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 487\u2013498. Kluwer Academic, Norwell (1999)"},{"key":"9130_CR36","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/355826.355828","volume":"5","author":"L. Schrage","year":"1979","unstructured":"Schrage, L.: A more portable FORTRAN random number generator. ACM Trans. Math. Softw. 5, 132\u2013138 (1979)","journal-title":"ACM Trans. Math. Softw."},{"key":"9130_CR37","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s002110050054","volume":"68","author":"M. Stoer","year":"1994","unstructured":"Stoer, M., Dahl, G.: A polyhedral approach to multicommodity survivable network design. Numer. Math. 68, 149\u2013167 (1994)","journal-title":"Numer. Math."},{"key":"9130_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.10.1.1","volume":"10","author":"M. Stoer","year":"1998","unstructured":"Stoer, M., Dahl, G.: A cutting-plane algorithm for multicommodity survivable network design problem. INFORMS J. Comput. 10, 1\u201311 (1998)","journal-title":"INFORMS J. Comput."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9130-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9130-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9130-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:31Z","timestamp":1559256871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9130-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,23]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9130"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9130-6","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,23]]}}}