{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T05:32:05Z","timestamp":1766467925449},"reference-count":17,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1016\/j.cor.2008.04.002","type":"journal-article","created":{"date-parts":[[2008,4,8]],"date-time":"2008-04-08T11:18:56Z","timestamp":1207653536000},"page":"1670-1682","source":"Crossref","is-referenced-by-count":20,"title":["An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs"],"prefix":"10.1016","volume":"36","author":[{"given":"Teresa","family":"Gomes","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Craveirinha","sequence":"additional","affiliation":[]},{"given":"Lu\u00edsa","family":"Jorge","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2008.04.002_bib1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230040204","article-title":"Disjoint paths in networks","volume":"4","author":"Suurballe","year":"1974","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.cor.2008.04.002_bib2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","article-title":"A quick method for finding shortest pairs of disjoint paths","volume":"14","author":"Suurballe","year":"1984","journal-title":"Networks"},{"key":"10.1016\/j.cor.2008.04.002_bib3","series-title":"IEEE INFOCOM 2004","article-title":"On finding disjoint paths in single and dual link cost networks","author":"Xu","year":"2004"},{"key":"10.1016\/j.cor.2008.04.002_bib4","series-title":"Proceedings of design of reliable communication networks (DRCN 2001)","first-page":"220","article-title":"Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks","author":"Laborczi","year":"2001"},{"key":"10.1016\/j.cor.2008.04.002_bib5","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1002\/net.3230220705","article-title":"Finding disjoint paths with different path costs: complexity and algorithms","volume":"22","author":"Li","year":"1992","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.cor.2008.04.002_bib6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TNET.2003.813044","article-title":"Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information","volume":"11","author":"Kodialam","year":"2003","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"2","key":"10.1016\/j.cor.2008.04.002_bib7","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1109\/TR.2004.829141","article-title":"On achieving optimal survivable routing for shared protection in survivable next-generation internet","volume":"53","author":"Ho","year":"2004","journal-title":"IEEE Transactions on Reliability"},{"key":"10.1016\/j.cor.2008.04.002_bib8","series-title":"Optical networks\u2014architecture and survivability","author":"Mouftah","year":"2003"},{"key":"10.1016\/j.cor.2008.04.002_bib9","series-title":"Digraphs: theory, algorithms and applications, Springer monographs in mathematics","author":"Bang-Jensen","year":"2002"},{"key":"10.1016\/j.cor.2008.04.002_bib10","series-title":"Networks 2004","first-page":"185","article-title":"Efficient algorithms for physically-disjoint routing in survivable networks","author":"Laborczi","year":"2004"},{"key":"10.1016\/j.cor.2008.04.002_bib11","unstructured":"Martins E, Pascoal M, Santos J. An algorithm for ranking loopless paths. Technical Report 99\/007, CISUC, 1999 \u3008http:\/\/www.mat.uc.pt\/\u223cmarta\/Publicacoes\/mps2.ps\u3009."},{"issue":"3","key":"10.1016\/j.cor.2008.04.002_bib12","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1142\/S0129054199000186","article-title":"Deviation algorithms for ranking shortest paths","volume":"10","author":"Martins","year":"1999","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"11","key":"10.1016\/j.cor.2008.04.002_bib13","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","article-title":"Finding the k shortest loopless paths in a network","volume":"17","author":"Yen","year":"1971","journal-title":"Management Science"},{"issue":"2","key":"10.1016\/j.cor.2008.04.002_bib14","first-page":"121","article-title":"A new implementation of Yen's ranking loopless paths algorithm","volume":"1","author":"Martins","year":"2003","journal-title":"4OR\u2014Quarterly Journal of the Belgian, French and Italian Operations Research Societies"},{"issue":"2","key":"10.1016\/j.cor.2008.04.002_bib15","first-page":"235","article-title":"An algorithm for calculating the k shortest paths with a maximum number of arcs","volume":"21","author":"Gomes","year":"2001","journal-title":"Investiga\u00e7\u00e3o Operacional"},{"key":"10.1016\/j.cor.2008.04.002_bib16","series-title":"Network flows","author":"Ford","year":"1962"},{"key":"10.1016\/j.cor.2008.04.002_bib17","unstructured":"Gomes T, Craveirinha J, Jorge L. An effective algorithm for obtaining minimal cost pairs of disjoint paths with dual arc costs. Technical Report 5, INESC\u2014Coimbra, Coimbra, Portugal; 2006. ISSN: 1645-2631."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054808000750?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054808000750?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T08:51:32Z","timestamp":1546159892000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054808000750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["S0305054808000750"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2008.04.002","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}