{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:46:10Z","timestamp":1742931970663,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030949"},{"type":"electronic","value":"9783642030956"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03095-6_60","type":"book-chapter","created":{"date-parts":[[2009,7,30]],"date-time":"2009-07-30T13:40:55Z","timestamp":1248961255000},"page":"638-650","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths"],"prefix":"10.1007","author":[{"given":"Chiun-Chieh","family":"Hsu","sequence":"first","affiliation":[]},{"given":"Da-Ren","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Hua-Yuan","family":"Ding","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"60_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: An aid to bibliographic search. Journal of the ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Journal of the ACM"},{"key":"60_CR2","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.37.2.170.15248","volume":"37","author":"S. Arunapuram","year":"2003","unstructured":"Arunapuram, S., Mathur, K., Solow, D.: Vehicle routing and scheduling with full truck loads. Transportation Science\u00a037, 170\u2013182 (2003)","journal-title":"Transportation Science"},{"key":"60_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0377-2217(93)90095-5","volume":"69","author":"J.A. Azevedo","year":"1993","unstructured":"Azevedo, J.A., Costa, M.E.O.S., Madeira, J.J.E.S., Martins, E.Q.V.: An algorithm for the ranking of shortest paths. European Journal of Operational Research\u00a069, 97\u2013106 (1993)","journal-title":"European Journal of Operational Research"},{"key":"60_CR4","unstructured":"Chauny, F., Ratsirahonana, L., Savard, G.: A model and column generation algorithm for the aircraft loading problem, Les Cahiers du GERAD G-2000-68, Ecole des Hautes Etudes Commerciales, Montreal (2000)"},{"key":"60_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/S0305-0548(02)00230-7","volume":"31","author":"Y.L. Chen","year":"2004","unstructured":"Chen, Y.L., Yang, H.H.: Finding the first k shortest paths in a time-window network. Computers and Operations Research\u00a031, 499\u2013513 (2004)","journal-title":"Computers and Operations Research"},{"key":"60_CR6","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/S0305-0548(98)00094-X","volume":"26","author":"J.M. Coutinho-Rodrigues","year":"1999","unstructured":"Coutinho-Rodrigues, J.M., Climaco, J.C.N., Current, J.R.: An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Computers and Operations Research\u00a026, 789\u2013798 (1999)","journal-title":"Computers and Operations Research"},{"key":"60_CR7","unstructured":"Desaulniers, G., Langevin, A., Riopel, D., Villeneuve, B.: Dispatching and conflict-free routing of automated guided vehicles: An exact approach, Les Cahiers du GERAD G-2002-31, Ecole des Hautes Etudes Commerciales, Montreal. International Journal of Flexible Manufacturing Systems (in press) (2002)"},{"issue":"2","key":"60_CR8","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"18","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM Journal on Computing\u00a018(2), 652\u2013673 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"60_CR9","unstructured":"Gustafsson, T.: A heuristic approach to column generation for airline crew scheduling, Licentiate thesis, Chalmers University of Technology and Goteborg University, S-412 96 Goteborg, Sweden (1999)"},{"key":"60_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G.Y. Handler","year":"1980","unstructured":"Handler, G.Y., Zang, I.A.: A dual algorithm for the constrained shortest path problem. Networks\u00a010, 293\u2013310 (1980)","journal-title":"Networks"},{"key":"60_CR11","first-page":"557","volume":"313","author":"P. Hansen","year":"1991","unstructured":"Hansen, P., Jaumard, B., de Aragao, M.P.: Un algorithme primal de programmation lineaire generalisee pourles programmes mixtes. Comptes Rendus de 1\u2018Academie des Sciences\u00a0313, 557\u2013560 (1991) (in French)","journal-title":"Comptes Rendus de 1\u2018Academie des Sciences"},{"key":"60_CR12","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/320998.321004","volume":"6","author":"W. Hoffman","year":"1959","unstructured":"Hoffman, W., Pavley, R.: A method for the solution of the N\u2018th best path problem. Journal of the Association for Computing Machinery\u00a06, 506\u2013514 (1959)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"60_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-48318-7_4","volume-title":"Algorithm Engineering","author":"V.M. Jim\u00e9nez","year":"1999","unstructured":"Jim\u00e9nez, V.M., Marzal, A.: Computing the k shortest paths: a new algorithm and an experimental comparison. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol.\u00a01668, pp. 15\u201329. Springer, Heidelberg (1999)"},{"key":"60_CR14","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1002\/net.3230120406","volume":"12","author":"N. Katoh","year":"1982","unstructured":"Katoh, N., Ibaraki, T., Mine, H.: An efficient algorithm for k shortest simple paths. Networks\u00a012, 411\u2013427 (1982)","journal-title":"Networks"},{"issue":"7","key":"60_CR15","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"E.L. Lawler","year":"1972","unstructured":"Lawler, E.L.: Aprocedure for computing the k best solutions to discrete optimization problems and its application to the shortest path. Management Science\u00a018(7), 401\u2013405 (1972)","journal-title":"Management Science"},{"key":"60_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0377-2217(84)90269-8","volume":"18","author":"E.Q.V. Martins","year":"1984","unstructured":"Martins, E.Q.V.: An algorithm for ranking paths that contain cycles. European Journal of Operational Research\u00a018, 123\u2013130 (1984)","journal-title":"European Journal of Operational Research"},{"key":"60_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.ejor.2004.01.032","volume":"165","author":"D. Villeneuve","year":"2005","unstructured":"Villeneuve, D., Desaulniers, G.: The shortest path problem with forbidden paths. European Journal of Operational Research\u00a0165, 97\u2013107 (2005)","journal-title":"European Journal of Operational Research"},{"key":"60_CR18","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.cor.2003.08.004","volume":"32","author":"H.H. Yang","year":"2005","unstructured":"Yang, H.H., Chen, Y.L.: Finding k shortest looping paths in a traffic-light network. Computers and Operations Research\u00a032, 571\u2013581 (2005)","journal-title":"Computers and Operations Research"},{"key":"60_CR19","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.apm.2005.05.005","volume":"30","author":"H.H. Yang","year":"2006","unstructured":"Yang, H.H., Chen, Y.L.: Finding K shortest looping paths with waiting time in a time-windows network. Applied Mathematical Modelling\u00a030, 458\u2013465 (2006)","journal-title":"Applied Mathematical Modelling"},{"issue":"11","key":"60_CR20","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"Y.J. Yen","year":"1971","unstructured":"Yen, Y.J.: Finding the k shortest loopless paths in a network. Management Science\u00a017(11), 712\u2013716 (1971)","journal-title":"Management Science"},{"key":"60_CR21","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.trb.2004.07.004","volume":"39","author":"N.J. Zijpp","year":"2005","unstructured":"Zijpp, N.J., Catalano, S.F.: Path enumeration by finding the constrained k-shortest paths. Transport Research B\u00a039, 545\u2013563 (2005)","journal-title":"Transport Research B"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03095-6_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:09:20Z","timestamp":1558267760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03095-6_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030949","9783642030956"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03095-6_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}