Finding disjoint paths with different path-costs: Complexity and algorithms
From MaRDI portal
Recommendations
- The complexity of finding two disjoint paths with min-max objective function
- The disjoint shortest paths problem
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
- Complexity and approximation results for the min-sum and min-max disjoint paths problems
- On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
Cites work
Cited in
(32)- The disjoint shortest paths problem
- The mixed evacuation problem
- On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms
- On the complexity of the disjoint paths problem
- On finding Min-Min disjoint paths
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm
- Failure disjoint paths
- The mixed evacuation problem
- Hardness of finding two edge-disjoint Min-Min paths in digraphs
- Multicriteria movement synchronization scheduling problems and algorithms
- Heuristics for finding a maximum number of disjoint bounded paths
- scientific article; zbMATH DE number 3946171 (Why is no real title available?)
- Finding paths with minimum shared edges
- On the complexity of the edge-disjoint min-min problem in planar digraphs
- The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
- Finding Disjoint Routes in Telecommunications Networks with Two Technologies
- Balanced paths in acyclic networks: Tractable cases and related approaches
- Disjoint (s, t)‐cuts in a network
- Approximation algorithms for disjoint st-paths with minimum activation cost
- A critical survey on the network optimization algorithms for evacuation planning problems
- Easy cases of deadlock detection in train scheduling
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Minimum cost disjoint paths under arc dependences. Algorithms for practice.
- Efficient Algorithms for k-Disjoint Paths Problems on DAGs
- The complexity of finding two disjoint paths with min-max objective function
- Algorithms and Computation
- A method to optimize evacuation instructions
- Computing disjoint paths with length constraints
- Finding disjoint paths with related path costs
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
- An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
This page was built for publication: Finding disjoint paths with different path-costs: Complexity and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022731)
