Pages that link to "Item:Q4022731"
From MaRDI portal
The following pages link to Finding disjoint paths with different path-costs: Complexity and algorithms (Q4022731):
Displaying 26 items.
- Finding paths with minimum shared edges (Q386426) (← links)
- On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855) (← links)
- The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
- A method to optimize evacuation instructions (Q647510) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks (Q877588) (← links)
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs (Q959515) (← links)
- An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs (Q975758) (← links)
- The disjoint shortest paths problem (Q1392552) (← links)
- The mixed evacuation problem (Q1631682) (← links)
- On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms (Q2232599) (← links)
- On the complexity of the disjoint paths problem (Q2367446) (← links)
- On finding Min-Min disjoint paths (Q2375950) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- Failure disjoint paths (Q2861540) (← links)
- The Mixed Evacuation Problem (Q2958300) (← links)
- Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs (Q3004683) (← links)
- Multicriteria movement synchronization scheduling problems and algorithms (Q3165912) (← links)
- Heuristics for finding a maximum number of disjoint bounded paths (Q3695028) (← links)
- The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms (Q4540052) (← links)
- Finding Disjoint Routes in Telecommunications Networks with Two Technologies (Q4545694) (← links)
- Disjoint (<i>s, t</i>)‐cuts in a network (Q4712978) (← links)
- (Q5020876) (← links)
- Easy Cases of Deadlock Detection in Train Scheduling (Q5106357) (← links)
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)
- Algorithms and Computation (Q5897927) (← links)