Route Planning with Flexible Objective Functions
From MaRDI portal
Publication:5233605
DOI10.1137/1.9781611972900.12zbMath1430.68207OpenAlexW113019534MaRDI QIDQ5233605
Robert Geisberger, Moritz Kobitzsch, Peter Sanders
Publication date: 11 September 2019
Published in: 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ed972c88a820ca64f8af24482d4b81ad179024bd
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Related Items (5)
An exact method for the biobjective shortest path problem for large-scale road networks ⋮ Unnamed Item ⋮ Candidate Sets for Alternative Routes in Road Networks ⋮ User-Constrained Multimodal Route Planning ⋮ Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles
This page was built for publication: Route Planning with Flexible Objective Functions
