{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:39Z","timestamp":1740099099306,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319975702"},{"type":"electronic","value":"9783319975719"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97571-9_28","type":"book-chapter","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T08:55:24Z","timestamp":1534236924000},"page":"360-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Algorithm for Constrained Shortest Path Problem Based on Incremental Lagrangian Dual Solution"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4657-0757","authenticated-orcid":false,"given":"Boris","family":"Novikov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1250-7178","authenticated-orcid":false,"given":"Roman","family":"Guralnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,15]]},"reference":[{"issue":"4","key":"28_CR1","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1002\/net.20292","volume":"53","author":"R Muhandiramge","year":"2009","unstructured":"Muhandiramge, R., Boland, N.: Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem. Networks 53(4), 358\u2013381 (2009). \nhttps:\/\/doi.org\/10.1002\/net.20292","journal-title":"Networks"},{"key":"28_CR2","doi-asserted-by":"publisher","unstructured":"Guralnik, R.: Incremental rerouting algorithm for single-vehicle VRPPD. In: Proceedings of the 18th International Conference on Computer Systems and Technologies, pp. 44\u201351. ACM (2017). \nhttps:\/\/doi.org\/10.1145\/3134302.3134326","DOI":"10.1145\/3134302.3134326"},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0191-2615(86)90020-2","volume":"20","author":"JJ Jaw","year":"1986","unstructured":"Jaw, J.J., Odoni, A.R., Psaraftis, H.N., Wilson, N.H.: A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transp. Res. Part B: Methodol. 20(3), 243\u2013257 (1986). \nhttps:\/\/doi.org\/10.1016\/0191-2615(86)90020-2","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1287\/trsc.32.3.208","volume":"32","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., et al.: Flight string models for aircraft fleeting and routing. Transp. Sci. 32(3), 208\u2013220 (1998). \nhttps:\/\/doi.org\/10.1287\/trsc.32.3.208","journal-title":"Transp. Sci."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Carlyle, W.M., Royset, J.O., Wood, R.K.: Routing military aircraft with a constrained shortest-path algorithm. Naval Postgraduate School, Monterey CA, Department of Operations Research (2007)","DOI":"10.21236\/ADA486703"},{"issue":"1","key":"28_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.23.1.1","volume":"23","author":"M Desrochers","year":"1989","unstructured":"Desrochers, M., Soumis, F.: A column generation approach to the urban transit crew scheduling problem. Transp. Sci. 23(1), 1\u20133 (1989). \nhttps:\/\/doi.org\/10.1287\/trsc.23.1.1","journal-title":"Transp. Sci."},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1504\/EJIE.2012.046669","volume":"6","author":"G Laporte","year":"2012","unstructured":"Laporte, G., Pascoal, M.M.: The pipeline and valve location problem. Eur. J. Ind. Eng. 6(3), 301\u2013321 (2012). \nhttps:\/\/doi.org\/10.1504\/EJIE.2012.046669","journal-title":"Eur. J. Ind. Eng."},{"issue":"2","key":"28_CR8","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1016\/j.ejor.2006.04.030","volume":"80","author":"EA Cabral","year":"2007","unstructured":"Cabral, E.A., Erkut, E., Laporte, G., Patterson, R.A.: The network design problem with relays. Eur. J. Oper. Res. 80(2), 834\u2013844 (2007). \nhttps:\/\/doi.org\/10.1016\/j.ejor.2006.04.030","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"28_CR9","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1016\/j.cor.2011.07.017","volume":"39","author":"OJ Smith","year":"2012","unstructured":"Smith, O.J., Boland, N., Waterer, H.: Solving shortest path problems with a weight constraint and replenishment arcs. Comput. Oper. Res. 39(5), 964\u2013984 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0167-6377(02)00192-X","volume":"31","author":"S Pallottino","year":"2003","unstructured":"Pallottino, S., Scutella, M.G.: A new algorithm for reoptimizing shortest paths when the arc costs change. Oper. Res. Lett. 31(2), 149\u2013160 (2003). \nhttps:\/\/doi.org\/10.1016\/S0167-6377(02)00192-X","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230130212","volume":"13","author":"YP Aneja","year":"1983","unstructured":"Aneja, Y.P., Aggarwal, V., Nair, K.P.: Shortest chain subject to side constraints. Networks 13(2), 295\u2013302 (1983). \nhttps:\/\/doi.org\/10.1002\/net.3230130212","journal-title":"Networks"},{"issue":"4","key":"28_CR12","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"JE Beasley","year":"1989","unstructured":"Beasley, J.E., Christofides, N.: An algorithm for the resource constrained shortest path problem. Networks 19(4), 379\u2013394 (1989). \nhttps:\/\/doi.org\/10.1002\/net.3230190402","journal-title":"Networks"},{"issue":"3","key":"28_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/net.10090","volume":"42","author":"I Dumitrescu","year":"2003","unstructured":"Dumitrescu, I., Boland, N.: Improved preprocessing, labeling and scaling algorithms for the weight constrained shortest path problem. Networks 42(3), 135\u2013153 (2003). \nhttps:\/\/doi.org\/10.1002\/net.10090","journal-title":"Networks"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-45253-2_30","volume-title":"Algorithms - ESA 2000","author":"K Mehlhorn","year":"2000","unstructured":"Mehlhorn, K., Ziegelmann, M.: Resource constrained shortest paths. In: Paterson, Mike S. (ed.) ESA 2000. LNCS, vol. 1879, pp. 326\u2013337. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/3-540-45253-2_30"},{"issue":"4","key":"28_CR15","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/net.20247","volume":"52","author":"WM Carlyle","year":"2008","unstructured":"Carlyle, W.M., Royset, J.O., Wood, R.K.: Lagrangian relaxation and enumeration for solving constrained shortest path problems. Networks 52(4), 256\u2013270 (2008). \nhttps:\/\/doi.org\/10.1002\/net.20247","journal-title":"Networks"},{"issue":"1","key":"28_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02092136","volume":"3","author":"G Gallo","year":"1980","unstructured":"Gallo, G.: Reoptimization procedures in shortest path problem. Rivista di matematica per le scienze economiche e sociali 3(1), 3\u201313 (1980). \nhttps:\/\/doi.org\/10.1007\/BF02092136","journal-title":"Rivista di matematica per le scienze economiche e sociali"},{"issue":"2","key":"28_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21(2), 267\u2013305 (1996). \nhttps:\/\/doi.org\/10.1006\/jagm.1996.0046","journal-title":"J. Algorithms"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-44679-6_30","volume-title":"Computing and Combinatorics","author":"V King","year":"2001","unstructured":"King, V., Thorup, M.: A space saving trick for directed dynamic transitive closure and shortest path algorithms. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 268\u2013277. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44679-6_30"},{"key":"28_CR19","unstructured":"Demetrescu, C.: Fully Dynamic Algorithms for Path Problems on Directed Graphs. Ph.D. thesis, Department of Computer and Systems Science, University of Rome \u201cLaSapienza\u201d (2001)"},{"key":"28_CR20","unstructured":"Zhu, X.: The Dynamic, Resource-Constrained Shortest Path Problem on an Acyclic Graph with Application in Column Generation and Literature Review on Sequence-Dependent Scheduling. Doctoral dissertation, Texas A&M University (2007)"},{"key":"28_CR21","series-title":"Applied Optimization","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-1-4757-6871-8_14","volume-title":"Transportation and Network Analysis: Current Trends","author":"S Nguyen","year":"2002","unstructured":"Nguyen, S., Pallottino, S., Scutell\u00e0, M.G.: A New Dual Algorithm for Shortest Path Reoptimization. In: Gendreau, M., Marcotte, P. (eds.) Transportation and Network Analysis: Current Trends. Applied Optimization, vol. 63, pp. 221\u2013235. Springer, Boston (2002). \nhttps:\/\/doi.org\/10.1007\/978-1-4757-6871-8_14"},{"issue":"2","key":"28_CR22","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/(SICI)1097-0037(199703)29:2<125::AID-NET7>3.0.CO;2-L","volume":"29","author":"S Pallottino","year":"1997","unstructured":"Pallottino, S., Scutell\u00e0, M.G.: Dual algorithms for the shortest path tree problem. Networks 29(2), 125\u2013133 (1997). \nhttps:\/\/doi.org\/10.1002\/(SICI)1097-0037(199703)29:2<125::AID-NET7>3.0.CO;2-L","journal-title":"Networks"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11535331_16","volume-title":"Advances in Spatial and Temporal Databases","author":"F Li","year":"2005","unstructured":"Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On trip planning queries in spatial databases. In: Bauzer Medeiros, C., Egenhofer, Max J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 273\u2013290. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11535331_16"}],"container-title":["Communications in Computer and Information Science","Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97571-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T09:20:22Z","timestamp":1534238422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-97571-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319975702","9783319975719"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97571-9_28","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]}}}