Flow improvement and network flows with fixed costs
From MaRDI portal
Recommendations
Cited in
(21)- Inapproximability and a polynomially solvable special case of a network improvement problem.
- On the flow cost lowering problem
- The minimum shift design problem
- Network expansion by adding arcs and/or nodes
- An automated network generation procedure for routing of unmanned aerial vehicles (UAVs) in a GIS environment
- Optimizing cost flows by modifying arc costs and capacities
- The minimum vulnerability problem on graphs
- Resource allocation by means of project networks: dominance results
- The minimum vulnerability problem on specific graph classes
- Finding paths with minimum shared edges
- Reverse maximum flow problem under the weighted Chebyshev distance
- The minimum vulnerability problem
- Approximation Algorithms for k-Hurdle Problems
- Approximation algorithms for \(k\)-hurdle problems
- Network flow problems with pricing decisions
- Integer linear programming formulations for the maximum flow blocker problem
- Network design on undirected series-parallel graphs
- A facility-integrated flow increment problem for emergency evacuation under budget constraints
- The complexity of flow expansion and electrical flow expansion
- Optimizing cost flows by edge cost and capacity upgrade
- Complexity analysis for maximum flow problems with arc reversals
This page was built for publication: Flow improvement and network flows with fixed costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4494412)
