A simpler and faster strongly polynomial algorithm for generalized flow maximization
From MaRDI portal
Recommendations
- A simpler and faster strongly polynomial algorithm for generalized flow maximization
- A strongly polynomial algorithm for generalized flow maximization
- A strongly polynomial algorithm for generalized flow maximization
- scientific article; zbMATH DE number 1187161
- New algorithms for generalized network flows
Cited in
(14)- scientific article; zbMATH DE number 1187161 (Why is no real title available?)
- Minimizing convex functions with rational minimizers
- A simple GAP-canceling algorithm for the generalized maximum flow problem
- Integer linear programming formulations for the maximum flow blocker problem
- A faster polynomial algorithm for the constrained maximum flow problem
- 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 algorithm for generalized flow maximization
- SOFSEM 2004: Theory and Practice of Computer Science
- scientific article; zbMATH DE number 871948 (Why is no real title available?)
- A strongly polynomial algorithm for approximate Forster transforms and its application to halfspace learning
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
This page was built for publication: A simpler and faster 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 Q5133966)
