{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:00:25Z","timestamp":1649005225796},"reference-count":21,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1051\/ro:2001104","type":"journal-article","created":{"date-parts":[[2003,11,19]],"date-time":"2003-11-19T08:42:52Z","timestamp":1069231372000},"page":"85-106","source":"Crossref","is-referenced-by-count":0,"title":["Multiple Routing Strategies in a Labelled Network"],"prefix":"10.1051","volume":"35","author":[{"given":"J.","family":"Maublanc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Peyrton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Quilliot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,8,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1051\/ro\/1990240201671","volume":"24","author":"Bendali","year":"1990","journal-title":"RAIRO Oper. Res."},{"key":"R2","unstructured":"T.H. Cormen, C.H. Leiserson and R.L. Rivest,Introduction to algorithms. MIT Press, Cambridge, Mass (1980)."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"E. Dijkstra, A note with two problems in connection with graphs.Numer. Math.I(1959) 269-271.","DOI":"10.1007\/BF01386390"},{"key":"R4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230090104","volume":"9","author":"Dionne","year":"1979","journal-title":"Network"},{"key":"R5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230100106","volume":"10","author":"Farley","year":"1980","journal-title":"Networks"},{"key":"R6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0121092","volume":"26","author":"Florian","year":"1986","journal-title":"Math. Programming Study"},{"key":"R7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"R8","unstructured":"M. Gondran and M. Minoux,Graphes et algorithmes. Ed. Eyrolles (1979)."},{"key":"R9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0166-218X(81)90026-3","volume":"3","author":"Karp","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"R10","unstructured":"J. Lauriere,Intelligence Artificielle. Eyrolles (1987)."},{"key":"R11","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"Lawler","year":"1972","journal-title":"Management Sci."},{"key":"R12","unstructured":"E. Minieka,Optimization algorithms for networks and graphs. Marcel Dekker Inc. (1978)."},{"key":"R13","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"Minoux","year":"1989","journal-title":"Network"},{"key":"R14","unstructured":"N. Nilsson,Problem solving methods in A.I. Mac Graw Hill (1971)."},{"key":"R15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0012-365X(85)90062-7","volume":"54","author":"Quilliot","year":"1985","journal-title":"Discrete Math."},{"key":"R16","first-page":"25","volume":"12","author":"Quilliot","year":"1991","journal-title":"Math. Appl."},{"key":"R17","unstructured":"M. Sakarovitch,Chemins, flots, ordonnancements dans les r\u00e9seaux. Hermann, Paris (1984)."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"M. Sakarovitch,The k shortest routes and k-shortest chains in a graph. Report ORC, Operation Research Center, University of California, Berkeley (1966) 66-32.","DOI":"10.21236\/AD0642823"},{"key":"R19","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230090303","volume":"9","author":"Shier","year":"1979","journal-title":"Networks"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"J. Wardrop, Some theoretical aspects of road traffic research.Proc. Inst. Civil Engrg.II(1952) 325-378.","DOI":"10.1680\/ipeds.1952.11362"},{"key":"R21","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/net.3230030302","volume":"3","author":"Yaged","year":"1973","journal-title":"Network"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001104\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,24]],"date-time":"2018-03-24T10:38:10Z","timestamp":1521887890000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":21,"journal-issue":{"issue":"1"},"alternative-id":["ro2117"],"URL":"https:\/\/doi.org\/10.1051\/ro:2001104","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}