On budget-constrained flow improvement.
From MaRDI portal
Publication:2583570
DOI10.1016/S0020-0190(98)00070-2zbMath1078.68641OpenAlexW1983839752MaRDI QIDQ2583570
Publication date: 17 January 2006
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00070-2
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)
Related Items (10)
Budget-constrained minimum cost flows ⋮ Robust flows with losses and improvability in evacuation planning ⋮ Interdiction problems on planar graphs ⋮ Approximation algorithms for \(k\)-hurdle problems ⋮ Improving spanning trees by upgrading nodes ⋮ Further Study on Reverse 1-Center Problem on Trees ⋮ On the optimum capacity of capacity expansion problems ⋮ A network simplex method for the budget-constrained minimum cost flow problem ⋮ Approximation Algorithms for k-Hurdle Problems ⋮ Resource allocation by means of project networks: Dominance results
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modifying edges of a network to obtain short subgraphs
- An efficient approximation algorithm for the survivable network design problem
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Analysis of a flow problem with fixed charges
- The Recognition of Series Parallel Digraphs
- Approximation Schemes for the Restricted Shortest Path Problem
- Two-Processor Scheduling with Start-Times and Deadlines
- Edge Weight Reduction Problems in Directed Acyclic Graphs
- Augmenting Undirected Edge Connectivity in Õ(n2) Time
- Linear-time computation of optimal subgraphs of decomposable graphs
- Network upgrading problems
- Improving Minimum Cost Spanning Trees by Upgrading Nodes
This page was built for publication: On budget-constrained flow improvement.
