乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:40:36Z","timestamp":1725532836142},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020100"},{"type":"electronic","value":"9783642020117"}],"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-02011-7_13","type":"book-chapter","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T09:12:20Z","timestamp":1243933940000},"page":"125-136","source":"Crossref","is-referenced-by-count":43,"title":["Pareto Paths with SHARC"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Delling","sequence":"first","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithmics of Large and Complex Networks","author":"D. Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS. Springer, Heidelberg (to appear 2009), http:\/\/i11www.ira.uka.de\/extra\/publications\/dssw-erpa-09.pdf"},{"key":"13_CR3","first-page":"109","volume-title":"Multiple Criteria Decision Making \u2013 Theory and Application","author":"P. Hansen","year":"1979","unstructured":"Hansen, P.: Bricriteria Path Problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making \u2013 Theory and Application, pp. 109\u2013127. Springer, Heidelberg (1979)"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"26","author":"E.Q. Martins","year":"1984","unstructured":"Martins, E.Q.: On a Multicriteria Shortest Path Problem. European Journal of Operational Research\u00a026(3), 236\u2013245 (1984)","journal-title":"European Journal of Operational Research"},{"key":"13_CR5","unstructured":"Theune, D.: Robuste und effiziente Methoden zur Lsung von Wegproblemen. Ph.D thesis (1995)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A. Warburton","year":"1987","unstructured":"Warburton, A.: Approximation of Pareto Optima in Multiple-Objective Shortest-Path Problems. Operations Research\u00a035(1), 70\u201379 (1987)","journal-title":"Operations Research"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-44688-5_15","volume-title":"Algorithm Engineering","author":"M. M\u00fcller-Hannemann","year":"2001","unstructured":"M\u00fcller-Hannemann, M., Weihe, K.: Pareto Shortest Paths is Often Feasible in Practice. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol.\u00a02141, pp. 185\u2013197. Springer, Heidelberg (2001)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. ACM Journal of Experimental Algorithmics\u00a012, Article 2.4 (2007)","DOI":"10.1145\/1227161.1227166"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-74247-0_13","volume-title":"Algorithmic Methods for Railway Optimization","author":"M. M\u00fcller-Hannemann","year":"2007","unstructured":"M\u00fcller-Hannemann, M., Schnee, M.: Finding All Attractive Train Connections by Multi-Criteria Pareto Search. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol.\u00a04359, pp. 246\u2013263. Springer, Heidelberg (2007)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-68552-4_26","volume-title":"Experimental Algorithms","author":"Y. Disser","year":"2008","unstructured":"Disser, Y., M\u00fcller-Hannemann, M., Schnee, M.: Multi-Criteria Shortest Paths in Time-Dependent Train Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 347\u2013361. Springer, Heidelberg (2008)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/1.9781611972887.2","volume-title":"Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008)","author":"R. Bauer","year":"2008","unstructured":"Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. In: Munro, I., Wagner, D. (eds.) Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pp. 13\u201326. SIAM, Philadelphia (2008)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-87744-8_28","volume-title":"Algorithms - ESA 2008","author":"D. Delling","year":"2008","unstructured":"Delling, D.: Time-Dependent SHARC-Routing. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 332\u2013343. Springer, Heidelberg (2008)"},{"key":"13_CR13","unstructured":"Lauther, U.: An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In: Geoinformation und Mobilit\u00e4t - von der Forschung zur praktischen Anwendung. IfGI prints, vol.\u00a022, pp. 219\u2013230 (2004)"},{"key":"13_CR14","volume-title":"Shortest Paths: Ninth DIMACS Implementation Challenge. DIMACS Book","author":"M. Hilger","year":"2009","unstructured":"Hilger, M., K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Fast Point-to-Point Shortest Path Computations with Arc-Flags. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge. DIMACS Book. American Mathematical Society, Providence (to appear, 2009)"},{"key":"13_CR15","first-page":"2","volume":"11","author":"R.H. M\u00f6hring","year":"2006","unstructured":"M\u00f6hring, R.H., Schilling, H., Sch\u00fctz, B., Wagner, D., Willhalm, T.: Partitioning Graphs to Speedup Dijkstra\u2019s Algorithm. ACM Journal of Experimental Algorithmics\u00a011, 2.8 (2006)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"13_CR16","unstructured":"Pellegrini, F.: SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Partitioning and Parallel and Sequential Sparse Matrix Ordering Package (2007)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway Hierarchies Star. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge. DIMACS Book. American Mathematical Society, Providence (to appear, 2009) (accepted for publication)","DOI":"10.1090\/dimacs\/074\/06"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02011-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T14:55:20Z","timestamp":1558364120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02011-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020100","9783642020117"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02011-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}