{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:39:00Z","timestamp":1759847940635,"version":"3.40.5"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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":["Journal of Heuristics"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1023\/a:1015492014030","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T23:44:51Z","timestamp":1041119091000},"page":"449-465","source":"Crossref","is-referenced-by-count":7,"title":["Bounds and Heuristics for the Shortest Capacitated Paths Problem"],"prefix":"10.1007","volume":"8","author":[{"given":"Marie-Christine","family":"Costa","sequence":"first","affiliation":[]},{"given":"Alain","family":"Hertz","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Mittaz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"407840_CR1","volume-title":"Networks Flows, Theory, Algorithms, Applications.","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., T. Magnanti, and J. Orlin. (1993). Networks Flows, Theory, Algorithms, Applications. Englewood Cliffs, NJ: Prentice Hall."},{"key":"407840_CR2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF02022997","volume":"41","author":"C.A. Anderson","year":"1993","unstructured":"Anderson, C.A., K. Fraughnaugh, M. Parker, and J. Ryan. (1993). \u201cPath Assignment for Call Routing: An Application of Tabu Search.\u201d Annals of Operations Research 41, 301\u2013312.","journal-title":"Annals of Operations Research"},{"key":"407840_CR3","volume-title":"Handbook of Genetic Algorithms","author":"L.A. Cox","year":"1991","unstructured":"Cox, L.A., L. Davis, and Y. Qiu. (1991). \u201cDynamic Anticipatory Routing in Circuit-Switched Telecommunications Networks.\u201d In L. Davis (ed.), Handbook of Genetic Algorithms, New York: VanNostrand Reinhold."},{"key":"407840_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L. (1981). \u201cThe Lagrangian Relaxation Method for Solving Integer Programming Problems.\u201d Management Science 27, 1\u201318.","journal-title":"Management Science"},{"key":"407840_CR5","volume-title":"Graphes et Algorithmes","author":"M. Gondran","year":"1985","unstructured":"Gondran, M. and M. Minoux. (1985). Graphes et Algorithmes. Paris: Eyrolles."},{"key":"407840_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(92)90248-9","volume":"35","author":"A. Hertz","year":"1992","unstructured":"Hertz, A. (1992). \u201cFinding a Feasible Course Schedule Using Tabu Search.\u201d Discrete Applied Mathematics 35, 255\u2013270.","journal-title":"Discrete Applied Mathematics"},{"key":"407840_CR7","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/opre.26.2.209","volume":"26","author":"J. Kennington","year":"1978","unstructured":"Kennington, J. (1978). \u201cA Survey of Linear Cost Multicommodity Networks Flows.\u201d Opns. Res. 26, 209\u2013236.","journal-title":"Opns. Res."},{"issue":"3","key":"407840_CR8","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/S0097539792241175","volume":"23","author":"P. Klein","year":"1994","unstructured":"Klein, P., S. Plotkin, C. Stein, and E. Tardos. (1994). \u201cFaster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts.\u201d SIAM J. on Comp. 23(3), 466\u2013487.","journal-title":"SIAM J. on Comp."},{"key":"407840_CR9","volume-title":"Paths, Flows and VLSI-Layout.","author":"B. Korte","year":"1990","unstructured":"Korte, B., L. Lovasz, H.J. Pr\u00f6mel, and A. Schrijver. (1990). Paths, Flows and VLSI-Layout. Heidelberg: Springer-Verlag."},{"issue":"4","key":"407840_CR10","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.39.4.492","volume":"39","author":"M. Laguna","year":"1993","unstructured":"Laguna, M. and F. Glover. (1993). \u201cBandwidth Packing: A Tabu Search Approach.\u201d Management Science 39(4), 492\u2013500.","journal-title":"Management Science"},{"key":"407840_CR11","volume-title":"Knapsack Problems","author":"S. Martello","year":"1990","unstructured":"Martello, S. and P. Toth. (1990). Knapsack Problems. Chichester: Wiley."},{"issue":"2","key":"407840_CR12","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.9.2.154","volume":"9","author":"R. McBride","year":"1997","unstructured":"McBride, R. and J. Mamer. (1997). \u201cSolving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm.\u201d INFORMS J. on Comp. 9(2), 154\u2013162.","journal-title":"INFORMS J. on Comp."},{"key":"407840_CR13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01202792","volume":"13","author":"M. Middendorf","year":"1993","unstructured":"Middendorf, M. and F. Pfeiffer. (1993). \u201cOn the Complexity of the Disjoint Path Problem.\u201d Combinatorica 13, 97\u2013107.","journal-title":"Combinatorica"},{"key":"407840_CR14","first-page":"21","volume":"3","author":"M. Minoux","year":"1975","unstructured":"Minoux, M. (1975). \u201cR\u00e9solution des Probl\u00e8mes de Multiflots en Nombres Entiers dans les Grands R\u00e9seaux.\u201d RAIRO Opns. Res. 3, 21\u201340 (in French).","journal-title":"RAIRO Opns. Res."},{"key":"407840_CR15","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1287\/mnsc.42.9.1277","volume":"42","author":"K. Park","year":"1996","unstructured":"Park, K., S. Kang, and S. Park. (1996). \u201cAn Integer Programming Approach to the Bandwidth Packing Problem.\u201d Management Science 42, 1277\u20131291.","journal-title":"Management Science"},{"key":"407840_CR16","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF02109857","volume":"2","author":"M. Parker","year":"1995","unstructured":"Parker, M. and J. Ryan. (1995). \u201cA Column Generation Algorithm for Bandwidth Packing.\u201d Telecommunications Systems 2, 185\u2013196.","journal-title":"Telecommunications Systems"},{"key":"407840_CR17","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"C. Reeves","year":"1993","unstructured":"Reeves, C. (1993). Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell."},{"key":"407840_CR18","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"Taillard, E. (1991). \u201cRobust Taboo Search for the Quadratic Assignment Problem.\u201d Parallel Computing 17, 433\u2013445.","journal-title":"Parallel Computing"},{"key":"407840_CR19","volume-title":"M\u00e9moire d'Ing\u00e9nieur","author":"I. Turki","year":"1997","unstructured":"Turki, I. (1997). \u201cOptimisation d'itin\u00e9raires de cables \u00e9lectriques,\u201d M\u00e9moire d'Ing\u00e9nieur, CNAM-IIE, Paris."},{"issue":"3","key":"407840_CR20","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1287\/ijoc.8.3.235","volume":"8","author":"R. Vachani","year":"1996","unstructured":"Vachani R., A. Shulman, P. Kubat, and J. Ward. (1996). \u201cMulticommodity Flows in Ring Networks.\u201d INFORMS J. on Comp. 8(3), 235\u2013242.","journal-title":"INFORMS J. on Comp."},{"key":"407840_CR21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(93)E0177-Z","volume":"61","author":"J. Vygen","year":"1995","unstructured":"Vygen, J. (1995). NP-Completeness of Some Edge-Disjoint Paths Problem.\u201d Discrete Appl. Math. 61, 83\u201390.","journal-title":"Discrete Appl. Math."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015492014030.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015492014030\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015492014030.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:05:33Z","timestamp":1747652733000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015492014030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["407840"],"URL":"https:\/\/doi.org\/10.1023\/a:1015492014030","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}