The k-centrum shortest path problem
From MaRDI portal
Recommendations
Cites work
- A Class of Label-Correcting Methods for the K Shortest Paths Problem
- A note on two problems in connexion with graphs
- A parametric approach to solving bicriterion shortest path problems
- An improved FPTAS for Restricted Shortest Path.
- Bottleneck extrema
- Centers to centroids in graphs
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Maximal Flow Through a Network
- Network flows. Theory, algorithms, and applications.
- Properties of thek-centra in a tree network
- Shortest path problems with time windows on nodes and arcs
- The k-centrum multi-facility location problem
Cited in
(9)- A comparison of formulations and solution methods for the minimum-envy location problem
- Revisiting k-sum optimization
- Bridging \(k\)-sum and CVaR optimization in MILP
- Ordered weighted average optimization in multiobjective spanning tree problem
- Shortest path with acceleration constraints: complexity and approximation algorithms
- Shortest paths with ordinal weights
- On discrete optimization with ordering
- On universal shortest paths
- Optimization-based computation and integration of ordered measures
This page was built for publication: The \(k\)-centrum shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997931)