{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:23:52Z","timestamp":1762521832993,"version":"3.41.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1109\/rndm.2015.7325218","type":"proceedings-article","created":{"date-parts":[[2015,11,12]],"date-time":"2015-11-12T23:12:08Z","timestamp":1447369928000},"page":"120-127","source":"Crossref","is-referenced-by-count":15,"title":["Protected shortest path visiting specified nodes"],"prefix":"10.1109","author":[{"given":"Teresa","family":"Gomes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sofia","family":"Marques","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucia","family":"Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marta","family":"Pascoal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Tipper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"121","article-title":"A new implementation of Yen's ranking loopless paths algorithm","volume":"1","author":"martins","year":"2003","journal-title":"4OR Quarterly Journal of the Belgian French and Italian Operations Research Societies"},{"journal-title":"Survivable Networks Algorithms for Diverse Routing","year":"1999","author":"bhandari","key":"ref11"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","article-title":"SNDlib 1.0-Survivable Network Design library","volume":"55","author":"orlowski","year":"2010","journal-title":"Networks"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1993.253246"},{"journal-title":"IBM ILOG CPLEX Optimization Studio V12 5","year":"2012","key":"ref14"},{"key":"ref15","article-title":"RSVP-TE: Extensions to RSVP for LSP tunnels","author":"awduche","year":"2001","journal-title":"IETF RFC 3209"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2011.5741159"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2009.4804331"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.3.395"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.5.909"},{"key":"ref8","first-page":"16","article-title":"Elementary shortest-paths visiting a given set of nodes","author":"de andrade","year":"2013","journal-title":"Simpósio Brasileiro de Pesquisa Operacional"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1015031"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2007.4444749"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.03.005"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"}],"event":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","start":{"date-parts":[[2015,10,5]]},"location":"Munich, Germany","end":{"date-parts":[[2015,10,7]]}},"container-title":["2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7311668\/7324297\/07325218.pdf?arnumber=7325218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T11:33:32Z","timestamp":1748691212000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7325218\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/rndm.2015.7325218","relation":{},"subject":[],"published":{"date-parts":[[2015,10]]}}}