{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:31:54Z","timestamp":1743010314974,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319930305"},{"type":"electronic","value":"9783319930312"}],"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-93031-2_26","type":"book-chapter","created":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T06:04:24Z","timestamp":1528351464000},"page":"361-376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Heuristic Variants of A$$^*$$ Search for 3D Flight Planning"],"prefix":"10.1007","author":[{"given":"Anders N.","family":"Knudsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Chiarandini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,8]]},"reference":[{"issue":"1","key":"26_CR1","first-page":"1.4:1","volume":"18","author":"GV Batz","year":"2013","unstructured":"Batz, G.V., Geisberger, R., Sanders, P., Vetter, C.: Minimum time-dependent travel times with contraction hierarchies. ACM J. Exp. Algorithmics 18(1), 1.4:1\u20131.4:43 (2013). Article no. 1.4","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0166-218X(96)00017-0","volume":"74","author":"H Yinnone","year":"1997","unstructured":"Yinnone, H.: On paths avoiding forbidden pairs of vertices in a graph. Discrete Appl. Math. 74(1), 85\u201392 (1997)","journal-title":"Discrete Appl. Math."},{"key":"26_CR5","unstructured":"Blanco, M., Bornd\u00f6rfer, R., Hoang, N.-D., Kaier, A., Schienle, A., Schlechte, T., Schlobach, S.: Solving time dependent shortest path problems on airway networks using super-optimal wind. In: 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS). OpenAccess Series in Informatics (OASIcs), vol. 54, pp. 12:1\u201312:15. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Bast, H., Delling, D., Goldberg, A., M\u00fcller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route planning in transportation networks (2015). arXiv:1504.05140 [cs.DS]","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-319-66158-2_23","volume-title":"Principles and Practice of Constraint Programming","author":"AN Knudsen","year":"2017","unstructured":"Knudsen, A.N., Chiarandini, M., Larsen, K.S.: Constraint handling in flight planning. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 354\u2013369. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_23"},{"key":"26_CR8","unstructured":"Knudsen, A.N., Chiarandini, M., Larsen, K.S.: Vertical optimization of resource dependent flight paths. In: 22nd European Conference on Artificial Intelligence (ECAI). Frontiers in Artificial Intelligence and Applications, vol. 285, pp. 639\u2013645. IOS Press (2016)"},{"key":"26_CR9","unstructured":"Blanco, M., Bornd\u00f6rfer, R., Dung Ho\u00e0ng, N., Kaier, A., Casas, P.M., Schlechte, T., Schlobach, S.: Cost projection methods for the shortest path problem with crossing costs. In: D\u2019Angelo, G., Dollevoet, T., (eds.) 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS). OpenAccess Series in Informatics (OASIcs), vol. 59, pp. 15:1\u201315:14. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"26_CR10","unstructured":"Jensen, C.K., Chiarandini, M., Larsen, K.S.: Flight planning in free route airspaces. In: D\u2019Angelo, G., Dollevoet, T., (eds.) 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS). OpenAccess Series in Informatics (OASIcs), vol. 59, pp. 14:1\u201314:14. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2017)"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93031-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:28:59Z","timestamp":1709832539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93031-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319930305","9783319930312"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93031-2_26","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":"8 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Delft","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"26 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2018\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}