Budget-constrained minimum cost flows
From MaRDI portal
Publication:281825
DOI10.1007/s10878-015-9865-yzbMath1347.90081OpenAlexW2069017795MaRDI QIDQ281825
Clemens Thielen, Michael Holzhauser, Sven O. Krumke
Publication date: 11 May 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9865-y
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
On the complexity and approximability of budget-constrained minimum cost flows ⋮ A novel approach to subgraph selection with multiple weights on arcs ⋮ The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation ⋮ \(\Gamma\)-robust optimization of project scheduling problems ⋮ The complexity of the timetable‐based railway network design problem ⋮ A generalized approximation framework for fractional network flow and packing problems ⋮ A network simplex method for the budget-constrained minimum cost flow problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimizing cost flows by edge cost and capacity upgrade
- Minimum cost flow algorithms for series-parallel networks
- Approximation algorithms for certain network improvement problems
- On the flow cost lowering problem
- The accessibility arc upgrading problem
- On budget-constrained flow improvement.
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Analysis of a flow problem with fixed charges
- Combinatorial Optimization with Rational Objective Functions
- The Recognition of Series Parallel Digraphs
- The quickest flow problem
- Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
- A capacity scaling algorithm for the constrained maximum flow problem
- Multicriteria Optimization
- Solving Bicriterion Mathematical Programs
This page was built for publication: Budget-constrained minimum cost flows
