{"id":"https://openalex.org/W2170173074","doi":"https://doi.org/10.1007/978-3-642-56094-1_24","title":"Route Specifications with a Linear Dual Graph","display_name":"Route Specifications with a Linear Dual Graph","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2170173074","doi":"https://doi.org/10.1007/978-3-642-56094-1_24","mag":"2170173074"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-56094-1_24","doi":"https://doi.org/10.1007/978-3-642-56094-1_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-56094-1_24","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Spatial Data Handling","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W2475388035","display_name":"Advances in Spatial Data Handling"},"type":"book-chapter","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051129003","display_name":"Stephan Winter","orcid":"https://orcid.org/0000-0002-3403-6939","observed_orcids":["https://orcid.org/0000-0002-3403-6939"]},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Stephan Winter","raw_affiliation_strings":["Institute for Geoinformation, Vienna University of Technology, Gusshausstr. 27-29, 1040, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Geoinformation, Vienna University of Technology, Gusshausstr. 27-29, 1040, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051129003"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":8.2914,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.97695035,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"329","last_page":"338"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.3970000147819519,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.3970000147819519,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.19300000369548798,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.10970000177621841,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/k-shortest-path-algorithm","display_name":"k-shortest path algorithm","score":0.7049999833106995},{"id":"https://openalex.org/keywords/round-trips","display_name":"round trips","score":0.45100000500679016},{"id":"https://openalex.org/keywords/tour-guides","display_name":"tour guides","score":0.32600000500679016}],"concepts":[{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.8319284319877625},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6691290140151978},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6461135745048523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5771339535713196},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5491710305213928},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.5308165550231934},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.5224401354789734},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5004980564117432},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4693855941295624},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4510466754436493},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4453431963920593},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2010188102722168},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18328163027763367},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17661571502685547},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12211835384368896},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-56094-1_24","doi":"https://doi.org/10.1007/978-3-642-56094-1_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-56094-1_24","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Spatial Data Handling","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.108.3545","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.3545","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.isprs.org/commission4/proceedings02/pdfpapers/096.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W138310113","https://openalex.org/W577619325","https://openalex.org/W1873394894","https://openalex.org/W2015809783","https://openalex.org/W2023132252","https://openalex.org/W2060484689","https://openalex.org/W2079702731","https://openalex.org/W2091662631","https://openalex.org/W2111795391","https://openalex.org/W2119257015","https://openalex.org/W2135819212","https://openalex.org/W2159656051","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2271010733","https://openalex.org/W2569531326","https://openalex.org/W3119604795"],"related_works":["https://openalex.org/W4233789573","https://openalex.org/W4416038564","https://openalex.org/W2071004564","https://openalex.org/W7096810098","https://openalex.org/W3159682657","https://openalex.org/W4393145378","https://openalex.org/W1640572913","https://openalex.org/W180888751","https://openalex.org/W2780454648","https://openalex.org/W2732957686"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-10-10T09:11:00.788812","created_date":"2016-06-24T00:00:00"}