{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:46:40Z","timestamp":1649213200567},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,8,21]],"date-time":"2009-08-21T00:00:00Z","timestamp":1250812800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s10878-009-9255-4","type":"journal-article","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T16:25:11Z","timestamp":1250785511000},"page":"394-414","source":"Crossref","is-referenced-by-count":0,"title":["An effective algorithm for obtaining the whole set of\u00a0minimal cost pairs of disjoint paths with dual arc costs"],"prefix":"10.1007","volume":"19","author":[{"given":"T.","family":"Gomes","sequence":"first","affiliation":[]},{"given":"J.","family":"Craveirinha","sequence":"additional","affiliation":[]},{"given":"L.","family":"Jorge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,21]]},"reference":[{"key":"9255_CR1","series-title":"Springer monographs in mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-3886-0","volume-title":"Digraphs: theory, algorithms and applications","author":"J Bang-Jensen","year":"2002","unstructured":"Bang-Jensen\u00a0J, Gutin\u00a0G (2002) Digraphs: theory, algorithms and applications. Springer monographs in mathematics. Springer, Berlin"},{"key":"9255_CR2","volume-title":"Survivable networks, algorithms for diverse routing","author":"R Bhandari","year":"1999","unstructured":"Bhandari\u00a0R (1999) Survivable networks, algorithms for diverse routing. Kluwer Academic, Norwell"},{"key":"9255_CR3","volume-title":"Network flows","author":"LR Ford Jr","year":"1962","unstructured":"Ford LR Jr, Fulkerson DR (1962) Network flows. Princeton University Press, Princeton"},{"key":"9255_CR4","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J\u00a0Assoc Comput Mach 34:596\u2013615","journal-title":"J\u00a0Assoc Comput Mach"},{"issue":"2","key":"9255_CR5","first-page":"235","volume":"21","author":"T Gomes","year":"2001","unstructured":"Gomes\u00a0T, Martins\u00a0L, Craveirinha\u00a0J (2001) An algorithm for calculating the k shortest paths with a maximum number of arcs. Investig Oper 21(2):235\u2013244","journal-title":"Investig Oper"},{"issue":"5","key":"9255_CR6","doi-asserted-by":"crossref","first-page":"1670","DOI":"10.1016\/j.cor.2008.04.002","volume":"36","author":"T Gomes","year":"2009","unstructured":"Gomes\u00a0T, Craveirinha\u00a0J, Jorge\u00a0L (2009) An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs. Comput Oper Res 36(5):1670\u20131682","journal-title":"Comput Oper Res"},{"issue":"16","key":"9255_CR7","first-page":"1105","volume":"12","author":"PH Ho","year":"2004","unstructured":"Ho PH, Tapolcai\u00a0J, Cinkler\u00a0T (2004a) Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels. IEEE\/ACM Trans Netw 12(16):1105\u20131118","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"9255_CR8","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1109\/TR.2004.829141","volume":"53","author":"PH Ho","year":"2004","unstructured":"Ho PH, Tapolcai\u00a0J, Mouftah HT (2004b) On achieving optimal survivable routing for shared protection in survivable next-generation Internet. IEEE Trans Reliability 53(2):216\u2013225","journal-title":"IEEE Trans Reliability"},{"issue":"3","key":"9255_CR9","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TNET.2003.813044","volume":"11","author":"M Kodialam","year":"2003","unstructured":"Kodialam\u00a0M, Lakshman TV (2003) Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information. IEEE\/ACM Trans Netw 11(3):399\u2013410","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9255_CR10","unstructured":"Laborczi\u00a0P, Tapolcai\u00a0J, Ho PH, Cinkler\u00a0T, Recski\u00a0A, Mouftah HT (2001) Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks. In: Cinkler, T. (ed) Proceedings of design of reliable communication networks (DCRN 2001), pp\u00a0220\u2013227"},{"key":"9255_CR11","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1002\/net.3230220705","volume":"22","author":"CL Li","year":"1992","unstructured":"Li CL, McCormick ST, Simchi-Levi\u00a0D (1992) Finding disjoint paths with different path costs: complexity and algorithms. Networks 22:653\u2013667","journal-title":"Networks"},{"issue":"2","key":"9255_CR12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10288-002-0010-2","volume":"1","author":"E Martins","year":"2003","unstructured":"Martins\u00a0E, Pascoal\u00a0M (2003) A new implementation of Yen\u2019s ranking loopless paths algorithm. 4OR 1(2):121\u2013134","journal-title":"4OR"},{"key":"9255_CR13","unstructured":"Martins\u00a0E, Pascoal\u00a0M, Santos\u00a0J (1999a) An algorithm for ranking loopless paths. Technical Report 99\/007, CISUC (1999). http:\/\/www.mat.uc.pt\/~marta\/Publicacoes\/mps2.ps"},{"issue":"3","key":"9255_CR14","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1142\/S0129054199000186","volume":"10","author":"E Martins","year":"1999","unstructured":"Martins\u00a0E, Pascoal\u00a0M, Santos\u00a0J (1999b) Deviation algorithms for ranking shortest paths. Int J Found Comput Sci 10(3):247\u2013263","journal-title":"Int J Found Comput Sci"},{"key":"9255_CR15","volume-title":"Optical networks\u2014architecture and survivability","author":"HT Mouftah","year":"2003","unstructured":"Mouftah HT, Ho PH (2003) Optical networks\u2014architecture and survivability. Kluwer Academic, Norwell"},{"key":"9255_CR16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"JW Suurballe","year":"1974","unstructured":"Suurballe JW (1974) Disjoint paths in networks. Networks 4:125\u2013145","journal-title":"Networks"},{"issue":"2","key":"9255_CR17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"JW Suurballe","year":"1984","unstructured":"Suurballe JW, Tarjan RE (1984) A quick method for finding shortest pairs of disjoint paths. Networks 14(2):325\u2013336","journal-title":"Networks"},{"key":"9255_CR18","volume-title":"EEE INFOCOM 2004","author":"D Xu","year":"2004","unstructured":"Xu\u00a0D, Chen\u00a0Y, Xiong\u00a0Y, Qiao\u00a0C, He\u00a0X (2004) On finding disjoint paths in single and dual link cost networks. In: EEE INFOCOM 2004. IEEE Press, New York"},{"issue":"11","key":"9255_CR19","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen JY (1971) Finding the k shortest loopless paths in a network. Manag Sci 17(11):712\u2013716","journal-title":"Manag Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9255-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9255-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9255-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:14Z","timestamp":1559261894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9255-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,21]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9255"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9255-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,21]]}}}