The following pages link to (Q4494412):
Displaying 13 items.
- The minimum vulnerability problem on specific graph classes (Q346526) (← links)
- Finding paths with minimum shared edges (Q386426) (← links)
- The minimum vulnerability problem (Q487032) (← links)
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Optimizing cost flows by edge cost and capacity upgrade (Q876725) (← links)
- Complexity analysis for maximum flow problems with arc reversals (Q965819) (← links)
- On the flow cost lowering problem (Q1600835) (← links)
- The minimum shift design problem (Q2468734) (← links)
- An automated network generation procedure for routing of unmanned aerial vehicles (UAVs) in a GIS environment (Q2642500) (← links)
- The Minimum Vulnerability Problem on Graphs (Q2942407) (← links)
- Resource allocation by means of project networks: Dominance results (Q3113507) (← links)
- Reverse maximum flow problem under the weighted Chebyshev distance (Q4634311) (← links)
- Approximation Algorithms for k-Hurdle Problems (Q5458550) (← links)
