Duality for balanced submodular flows
From MaRDI portal
Publication:581206
DOI10.1016/0166-218X(86)90053-3zbMath0626.90023OpenAlexW2042718895MaRDI QIDQ581206
Publication date: 1986
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(86)90053-3
Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)
Related Items
On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem, A note on \(K\) best network flows, A submodular optimization problem with side constraints, A strongly polynomial time algorithm for a constrained submodular optimization problem, Towards equitable distribution via proportional equity constraints, On the complexity of the dual method for maximum balanced flows
Cites Work
- Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
- Finding feasible vectors of Edmonds-Giles polyhedra
- Linear and combinatorial sharing problems
- Linear and combinatorial optimization in ordered algebraic structures
- Minimization on submodular flows
- The ellipsoid method and its consequences in combinatorial optimization
- Structures of polyhedra determined by submodular functions on crossing families
- Sharing problems
- Combinatorial Optimization with Rational Objective Functions
- An Algorithm for Submodular Functions on Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
