A strongly polynomial algorithm for generalized flow maximization
From MaRDI portal
Publication:2976148
Recommendations
- A strongly polynomial algorithm for generalized flow maximization
- A simpler and faster strongly polynomial algorithm for generalized flow maximization
- A simpler and faster strongly polynomial algorithm for generalized flow maximization
- scientific article; zbMATH DE number 4204092
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
Cites work
- A Faster Combinatorial Algorithm for the Generalized Circulation Problem
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
- A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)
- A Strongly Polynomial Algorithm for a Special Class of Linear Programs
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A polynomial dual simplex algorithm fot the generalized circulation problem.
- A simple GAP-canceling algorithm for the generalized maximum flow problem
- A strongly polynomial minimum cost circulation algorithm
- Combinatorial Algorithms for the Generalized Circulation Problem
- Combinatorial interior point methods for generalized network flow problems
- Concave generalized flows with applications to market equilibria
- Fast and simple approximation schemes for generalized flow.
- Finding minimum-cost circulations by canceling negative cycles
- Improving time bounds on maximum generalised flow computations by contracting the network
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Max flows in \(O(nm)\) time, or better
- Monotonizing linear programs with up to two nonzeroes per column
- New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
- New algorithms for generalized network flows
- On Max Flows with Gains and Pure Min-Cost Flows
- On the equivalence of some generalized network problems to pure network problems
- Optimum flows in general communication networks
- Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
- Speeding up Karmarkar's algorithm for multicommodity flows
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Towards a Genuinely Polynomial Algorithm for Linear Programming
Cited in
(17)- A strongly polynomial algorithm for the minimum maximum flow degree problem
- Minimizing convex functions with rational minimizers
- scientific article; zbMATH DE number 66616 (Why is no real title available?)
- A faster polynomial algorithm for the constrained maximum flow problem
- On maximum flows in polyhedral domains
- A simpler and faster strongly polynomial algorithm for generalized flow maximization
- A simpler and faster strongly polynomial algorithm for generalized flow maximization
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
- A Polynomial Algorithm for Weighted Abstract Flow
- A strongly polynomial algorithm for generalized flow maximization
- A strongly polynomial contraction-expansion algorithm for network flow problems
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- A critical survey on the network optimization algorithms for evacuation planning problems
- SOFSEM 2004: Theory and Practice of Computer Science
- scientific article; zbMATH DE number 871948 (Why is no real title available?)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
- Generalized maximum flow over time with intermediate storage
This page was built for publication: A strongly polynomial algorithm for generalized flow maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976148)
