Computing Pareto-Optimal Transit Routes Through Mathematical Algorithms

DOI10.1007/978-3-319-89920-6_62zbMath1397.90255OpenAlexW2804249653MaRDI QIDQ4685792

Armin Fügenschuh, M. Fawad Zazai

Publication date: 9 October 2018

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_62

zbMATH Keywords

graph theorycomputational geometryshortest path problemDijkstra's algorithmAfghanistantransit routes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)

Related Items (2)

Editorial. OPTE special issue on technical operations research (TOR) ⋮ Computing the trajectories for the development of optimal routes

Cites Work

• A note on two problems in connexion with graphs
• Multicriteria Optimization

This page was built for publication: Computing Pareto-Optimal Transit Routes Through Mathematical Algorithms