scientific article; zbMATH DE number 5610761
From MaRDI portal
Publication:3182199
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Distance in graphs (05C12) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Algorithms in computer science (68Wxx) Operations research and management science (90Bxx)
Cited in
(12)- Shortest paths with shortest detours. A biobjective routing problem
- Generating hard instances for robust combinatorial optimization
- An auction-based approach for the re-optimization shortest path tree problem
- Integer programming formulations for the elementary shortest path problem
- Graph bisection with Pareto optimization
- Real-time traffic assignment using engineered customizable contraction hierarchies
- Computing constrained shortest-paths at scale
- Customizable contraction hierarchies
- Parametric multi-step scheme for GPU-accelerated graph decomposition into strongly connected components
- Financial interbanking networks resilience under shocks propagation
- Improved dominance filtering for unions and Minkowski sums of Pareto sets
- An exact combinatorial algorithm for minimum graph bisection
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3182199)
