Variants of shortest path problems
From MaRDI portal
Publication:2865872
Recommendations
Cited in
(12)- On the generality of the greedy algorithm for solving matroid base problems
- An algebraic framework for multi-objective and robust variants of path problems
- Shortest path with acceleration constraints: complexity and approximation algorithms
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
- Balanced Optimization with Vector Costs
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
- Robust balanced optimization
- On universal shortest paths
- A class of exponential neighbourhoods for the quadratic travelling salesman problem
- Shortest paths with shortest detours. A biobjective routing problem
- A branch-and-cut algorithm for the balanced traveling salesman problem
- The \(k\)-centrum shortest path problem
This page was built for publication: Variants of shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865872)