Duality for balanced submodular flows
From MaRDI portal
Publication:581206
DOI10.1016/0166-218X(86)90053-3zbMATH Open0626.90023OpenAlexW2042718895MaRDI QIDQ581206FDOQ581206
Authors: Uwe T. Zimmermann 
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)
Cites Work
- Linear and combinatorial optimization in ordered algebraic structures
- The ellipsoid method and its consequences in combinatorial optimization
- Title not available (Why is that?)
- Combinatorial Optimization with Rational Objective Functions
- Minimization on submodular flows
- Finding feasible vectors of Edmonds-Giles polyhedra
- Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear and combinatorial sharing problems
- Structures of polyhedra determined by submodular functions on crossing families
- Sharing problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithm for Submodular Functions on Graphs
Cited In (7)
- On the complexity of the dual method for maximum balanced flows
- A submodular optimization problem with side constraints
- A strongly polynomial time algorithm for a constrained submodular optimization problem
- Duality in balance optimization subset selection
- A note on \(K\) best network flows
- Towards equitable distribution via proportional equity constraints
- On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem
This page was built for publication: Duality for balanced submodular flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q581206)
