Shortest paths with shortest detours. A biobjective routing problem
From MaRDI portal
Publication:1673931
DOI10.1007/s10957-017-1145-9zbMath1373.90130OpenAlexW2738707309MaRDI QIDQ1673931
David Willems, Stefan Ruzika, Carolin Torchiani, Jan Peter Ohst
Publication date: 27 October 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-017-1145-9
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the detour-critical edge of a shortest path between two nodes
- Generalized multiple objective bottleneck problems
- The computational complexity of the relative robust shortest path problem with interval data
- On a multicriteria shortest path problem
- Shortest paths without a map
- The k most vital arcs in the shortest path problem
- Most vital links and nodes in weighted networks
- Robust discrete optimization and its applications
- Finding the most vital node of a shortest path.
- On the robust shortest path problem.
- On the sum-max bicriterion path problem.
- Interval data minmax regret network optimization problems
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Shortest-path network interdiction
- Fibonacci heaps and their uses in improved network optimization algorithms
- Multicriteria Optimization
- Theory and Applications of Models of Computation
This page was built for publication: Shortest paths with shortest detours. A biobjective routing problem
