Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
From MaRDI portal
Recommendations
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- Sensitive and parametric analysis of the maximum flow in a network
- Sensitivity analysis on the all pairs q-route flows in a network
- Sensitivity analysis for bottleneck assignment problems
- The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
- scientific article; zbMATH DE number 792651
- Publication:4489157
- scientific article; zbMATH DE number 3991234
- Publication:4726020
Cites work
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
- A randomized linear-time algorithm to find minimum spanning trees
- A simple version of Karzanov's blocking flow algorithm
- Advances in sensitivity analysis and parametric programming
- Arc tolerances in shortest path and network flow problems
- Finding the most vital edge with respect to minimum spanning tree in weighted graphs
- scientific article; zbMATH DE number 1114459 (Why is no real title available?)
- NC algorithms for the Single Most Vital Edge problem with respect to shortest paths
- Network flows. Theory, algorithms, and applications.
- On the difficulty of some shortest path problems
- Parallel algorithm for finding the most vital edge in weighted graphs
- Parallel algorithms for finding the most vital edge with respect to minimum spanning tree
- The k most vital arcs in the shortest path problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Undirected single-source shortest paths with positive integer weights in linear time
Cited in
(22)- Extending single tolerances to set tolerances
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
- The continuous maximum capacity path interdiction problem
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
- Multicriteria investment problem with Savage's risk criteria: theoretical aspects of stability and case study
- A tolerance-based heuristic approach for the weighted independent set problem
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
- Ordered weighted average combinatorial optimization: formulations and their properties
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- Sensitivity analysis for bottleneck assignment problems
- Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network
- Sensitivity analysis on the all pairs q-route flows in a network
- Efficient computation of tolerances in the weighted independent set problem for trees
- Efficient computation of tolerances in the weighted independent set problem for some classes of graphs
- scientific article; zbMATH DE number 792651 (Why is no real title available?)
- Quantitative analysis of flow distributions in a multiuser telecommunication network
- Note on a vertex stability radius in the shortest path problem
- Computation of lower tolerances of combinatorial bottleneck problems
- Efficient computation of all tolerances in the sparse maxmin path problem
- Efficient online sensitivity analysis for the injective bottleneck path problem
- Approximating the stability region for binary mixed-integer programs
- Bottleneck flows in unit capacity networks
This page was built for publication: Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1771306)