{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T16:22:04Z","timestamp":1756311724886,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319914510"},{"type":"electronic","value":"9783319914527"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","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-91452-7_16","type":"book-chapter","created":{"date-parts":[[2018,5,12]],"date-time":"2018-05-12T06:43:19Z","timestamp":1526107399000},"page":"239-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Towards Efficient Path Skyline Computation in Bicriteria Networks"],"prefix":"10.1007","author":[{"given":"Dian","family":"Ouyang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,13]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0377-2217(89)90215-4","volume":"43","author":"J Brumbaugh-Smith","year":"1989","unstructured":"Brumbaugh-Smith, J., Shier, D.: An empirical investigation of some bicriterion shortest path algorithms. Eur. J. Oper. Res. 43(2), 216\u2013224 (1989)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"16_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1111\/j.1475-3995.2011.00815.x","volume":"19","author":"JC Cl\u00edmaco","year":"2012","unstructured":"Cl\u00edmaco, J.C., Pascoal, M.: Multicriteria path and tree problems: discussion on exact algorithms and applications. Int. Trans. Oper. Res. 19(1\u20132), 63\u201398 (2012)","journal-title":"Int. Trans. Oper. Res."},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/0377-2217(82)90205-3","volume":"11","author":"JCN Climaco","year":"1982","unstructured":"Climaco, J.C.N., Martins, E.Q.V.: A bicriterion shortest path algorithm. Eur. J. Oper. Res. 11(4), 399\u2013404 (1982)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-02011-7_13","volume-title":"Experimental Algorithms","author":"Daniel Delling","year":"2009","unstructured":"Delling, D., Wagner, D.: Pareto paths with SHARC. In: Proceedings of the SEA, pp. 125\u2013136 (2009)"},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectr. 22(4), 425\u2013460 (2000)","journal-title":"OR Spectr."},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0377-2217(01)00188-6","volume":"139","author":"V Gabrel","year":"2002","unstructured":"Gabrel, V., Vanderpooten, D.: Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite. Eur. J. Oper. Res. 139(3), 533\u2013542 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"17","key":"16_CR7","doi-asserted-by":"publisher","first-page":"3081","DOI":"10.1016\/j.comnet.2010.05.017","volume":"54","author":"RG Garroppo","year":"2010","unstructured":"Garroppo, R.G., Giordano, S., Tavanti, L.: A survey on multi-constrained optimal path computation: exact and approximate algorithms. Comput. Netw. 54(17), 3081\u20133107 (2010)","journal-title":"Comput. Netw."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-48782-8_9","volume-title":"Multiple Criteria Decision Making Theory and Application","author":"P Hansen","year":"1980","unstructured":"Hansen, P.: Bicriterion path problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making Theory and Application, pp. 109\u2013127. Springer, Berlin (1980). https:\/\/doi.org\/10.1007\/978-3-642-48782-8_9"},{"doi-asserted-by":"crossref","unstructured":"Jang, S., Yoo, J.: Processing continuous skyline queries in road networks. In: Computer Science and Its Applications, pp. 353\u2013356 (2008)","key":"16_CR9","DOI":"10.1109\/CSA.2008.30"},{"doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Renz, M., Schubert, M.: Route skyline queries: a multi-preference path planning approach. In: Proceedings of the ICDE, pp. 261\u2013272 (2010)","key":"16_CR10","DOI":"10.1109\/ICDE.2010.5447845"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"EQV Martins","year":"1984","unstructured":"Martins, E.Q.V.: On a multicriteria shortest path problem. Eur. J. Oper. Res. 16(2), 236\u2013245 (1984)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0377-2217(91)90094-C","volume":"53","author":"J Mote","year":"1991","unstructured":"Mote, J., Murthy, I., Olson, D.L.: A parametric approach to solving bicriterion shortest path problems. Eur. J. Oper. Res. 53(1), 81\u201392 (1991)","journal-title":"Eur. J. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Lin, Y., Yiu, M.L.: Preference queries in large multi-cost transportation networks. In: Proceedings of the ICDE, pp. 533\u2013544 (2010)","key":"16_CR13","DOI":"10.1109\/ICDE.2010.5447851"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10479-006-0072-1","volume":"147","author":"M M\u00fcller-Hannemann","year":"2006","unstructured":"M\u00fcller-Hannemann, M., Weihe, K.: On the cardinality of the Pareto set in bicriteria shortest path problems. Ann. Oper. Res. 147(1), 269\u2013286 (2006)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1016\/j.cor.2008.02.002","volume":"36","author":"A Raith","year":"2009","unstructured":"Raith, A., Ehrgott, M.: A comparison of solution strategies for biobjective shortest path problems. Comput. Oper. Res. 36(4), 1299\u20131331 (2009)","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Sacharidis, D., Bouros, P., Chondrogiannis, T.: Finding the most preferred path. In: Proceedings of the SIGSPATIAL (2017)","key":"16_CR16","DOI":"10.1145\/3139958.3140029"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-46618-2_15","volume-title":"Recent Advances and Historical Development of Vector Optimization","author":"P Serafini","year":"1987","unstructured":"Serafini, P.: Some considerations about computational complexity for multi objective combinatorial problems. In: Jahn, J., Krabs, W. (eds.) Recent Advances and Historical Development of Vector Optimization, pp. 222\u2013232. Springer, Berlin (1987). https:\/\/doi.org\/10.1007\/978-3-642-46618-2_15"},{"doi-asserted-by":"crossref","unstructured":"Shekelyan, M., Joss\u00e9, G., Schubert, M.: Linear path skylines in multicriteria networks. In: Proceedings of the ICDE, pp. 459\u2013470 (2015)","key":"16_CR18","DOI":"10.1109\/ICDE.2015.7113306"},{"issue":"2","key":"16_CR19","first-page":"199","volume":"17","author":"AJ Skriver","year":"2000","unstructured":"Skriver, A.J.: A classification of bicriterion shortest path (BSP) algorithms. Asia-Pac. J. Oper. Res. 17(2), 199 (2000)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"6","key":"16_CR20","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/S0305-0548(99)00037-4","volume":"27","author":"AJ Skriver","year":"2000","unstructured":"Skriver, A.J., Andersen, K.A.: A label correcting approach for solving bicriterion shortest-path problems. Comput. Oper. Res. 27(6), 507\u2013524 (2000)","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Storandt, S.: Route planning for bicycles-exact constrained shortest paths made practical via contraction hierarchy. In: ICAPS, vol. 4, p. 46 (2012)","key":"16_CR21","DOI":"10.1609\/icaps.v22i1.13495"},{"issue":"2","key":"16_CR22","doi-asserted-by":"publisher","first-page":"269","DOI":"10.2478\/v10006-007-0023-2","volume":"17","author":"Z Tarapata","year":"2007","unstructured":"Tarapata, Z.: Selected multicriteria shortest path problems: an analysis of complexity, models and adaptation of standard algorithms. Int. J. Appl. Math. Comput. Sci. 17(2), 269\u2013287 (2007)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"issue":"4","key":"16_CR23","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.0.CO;2-O","volume":"8","author":"E Ulungu","year":"1999","unstructured":"Ulungu, E., Teghem, J., Fortemps, P., Tuyttens, D.: MOSA method: a tool for solving multiobjective combinatorial optimization problems. J. Multicriteria Decis. Anal. 8(4), 221 (1999)","journal-title":"J. Multicriteria Decis. Anal."},{"doi-asserted-by":"crossref","unstructured":"Yang, B., Guo, C., Jensen, C.S., Kaul, M., Shang, S.: Multi-cost optimal route planning under time-varying uncertainty. In: Proceedings of the ICDE (2014)","key":"16_CR24","DOI":"10.1109\/ICDE.2014.6816646"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91452-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:15:07Z","timestamp":1709831707000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-91452-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319914510","9783319914527"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91452-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ict.griffith.edu.au\/conferences\/dasfaa2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}