{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T07:28:41Z","timestamp":1775978921804,"version":"3.50.1"},"reference-count":55,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1109\/icton.2015.7193456","type":"proceedings-article","created":{"date-parts":[[2015,8,13]],"date-time":"2015-08-13T22:54:16Z","timestamp":1439506456000},"page":"1-17","source":"Crossref","is-referenced-by-count":6,"title":["Constrained shortest path problems: state-of-the-art and recent advances"],"prefix":"10.1109","author":[{"given":"P.","family":"Festa","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/012","article-title":"Network flows and matching: First DIMACS Implementation Challenge","author":"johnson","year":"1993"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-48318-7_4","article-title":"Computing the k shortest paths: A new algorithm and an experimental comparison","volume":"1668","author":"jim\u00e9nez","year":"1999","journal-title":"Proceedings of the 3rd Workshop on Algorithm Engineering"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-642-48782-8_9","article-title":"Bicriterion path problems","volume":"177","author":"hansen","year":"1980","journal-title":"Multiple Criteria Decision Making Theory and Application"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100403"},{"key":"ref31","article-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"garey","year":"1979"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288320"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0197"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25486-2_2"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.1.42.15151"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.04.029"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-010-0258-y"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121087"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130212"},{"key":"ref1","article-title":"Network Flows: Theory, Algorithms and Applications","author":"ahuja","year":"1993"},{"key":"ref20","first-page":"357","article-title":"Plus court chemin avec contraintes d'horaires","volume":"17","author":"desrosiers","year":"1983","journal-title":"R A I R O Recherche Operationnelle\/Operations Res"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140406"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00149-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/net.10090"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00205-3"},{"key":"ref25","first-page":"652","article-title":"Finding the k shortest paths","volume":"28","author":"eppstein","year":"1999"},{"key":"ref50","article-title":"Capacitated vehicle-routing problems in the vehicle routing problem","author":"toth","year":"2002","journal-title":"SIAM Monographs on Discrete Mathematics and Applications"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2005.860992"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref54","first-page":"271","article-title":"Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees","author":"xue","year":"2000"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1080\/07408170304359"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2006.11.006"},{"key":"ref10","article-title":"Scheduling duties by adaptive column generation","author":"bornd\u00f6rfer","year":"2001","journal-title":"Technical report Konrad-Zuse-Zentrum f&#x00FC;r Informationstechnik"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592101"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(66)90020-5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0118"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.27.3.548"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.27.1.161"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140208"},{"key":"ref17","first-page":"191","article-title":"A generalized permanent labeling algorithm for the shortest path problem with time windows","volume":"26","author":"desrochers","year":"1988","journal-title":"INFOR: Information Systems and Operational Research"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.23.1.1"},{"key":"ref19","article-title":"Time constrained routing and scheduling","author":"desrosiers","year":"0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.32.3.208"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800250314"},{"key":"ref6","article-title":"Dynamic programming","author":"bellman","year":"1957"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190402"},{"key":"ref8","article-title":"Network optimization: continuos and discrete models","author":"bertsekas","year":"1998"},{"key":"ref7","article-title":"Linear networks optimization: Algorithms and Codes","author":"bertsekas","year":"1991"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.6028\/jres.086.013"},{"key":"ref9","article-title":"Dynamic Programming and Optimal Control","volume":"i","author":"bertsekas","year":"2005"},{"key":"ref46","first-page":"1","article-title":"Implementations and empirical comparison of k shortest loopless path algorithms","author":"pascoal","year":"2006","journal-title":"9th DIMACS Implementation Challenge-The Shortest Path Problem DIMACS Center"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.659634"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-46618-2_15"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1002\/net.20212"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(01)00069-4"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120406"},{"key":"ref44","author":"nygaard","year":"2000","journal-title":"Shortest Path Methods in Representation and Compression of Signals and Image Contours"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1287\/opre.47.6.873"}],"event":{"name":"2015 17th International Conference on Transparent Optical Networks (ICTON)","location":"Budapest","start":{"date-parts":[[2015,7,5]]},"end":{"date-parts":[[2015,7,9]]}},"container-title":["2015 17th International Conference on Transparent Optical Networks (ICTON)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7173926\/7193279\/07193456.pdf?arnumber=7193456","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T10:18:48Z","timestamp":1567073928000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7193456\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/icton.2015.7193456","relation":{},"subject":[],"published":{"date-parts":[[2015,7]]}}}