Two strongly polynomial cut cancelling algorithms for minimum cost network flow
From MaRDI portal
(Redirected from Publication:689972)
Recommendations
- On dual minimum cost flow algorithms (extended abstract)
- On dual minimum cost flow algorithms
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow
- A new strongly polynomial dual network simplex algorithm
Cites work
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
- A characterization of the minimum cycle mean in a digraph
- A Fast Parametric Maximum Flow Algorithm and Applications
- A new approach to the maximum-flow problem
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- A strongly polynomial minimum cost circulation algorithm
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
- An O (n 2 (m + N log n )log n ) min-cost flow algorithm
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- Canceling most helpful total cuts for minimum cost network flow
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Computing maximum mean cuts
- Depth-First Search and Linear Graph Algorithms
- Diagonal similarity and equivalence for matrices over groups with 0
- Faster algorithms for the shortest path problem
- Finding minimum-cost circulations by canceling negative cycles
- Finding Minimum-Cost Circulations by Successive Approximation
- scientific article; zbMATH DE number 432811 (Why is no real title available?)
- scientific article; zbMATH DE number 3121287 (Why is no real title available?)
- scientific article; zbMATH DE number 3156381 (Why is no real title available?)
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3718824 (Why is no real title available?)
- scientific article; zbMATH DE number 193993 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 515931 (Why is no real title available?)
- scientific article; zbMATH DE number 742963 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 3365043 (Why is no real title available?)
- Improved Time Bounds for the Maximum Flow Problem
- Monotone networks
- On the computational behavior of a polynomial-time network flow algorithm
- Parallel concepts in graph theory
- Reducing Matching to Polynomial Size Linear Programming
- Scaling algorithms for network problems
- Sensitivity theorems in integer linear programming
- The auction algorithm: A distributed relaxation method for the assignment problem
- The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
Cited in
(23)- Tight bounds on the number of minimum-mean cycle cancellations and related results
- Computing maximum mean cuts
- How to compute least infeasible flows
- Fractional 0-1 programming: applications and algorithms
- A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
- The minimum mean cycle-canceling algorithm for linear programs
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem
- A new approach for computing a most positive cut using the minimum flow algorithms
- Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow
- Minimax inverse problems of minimum cuts
- On dual minimum cost flow algorithms (extended abstract)
- Finding minimum-cost circulations by canceling negative cycles
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem
- New polynomial-time cycle-canceling algorithms for minimum-cost flows
- scientific article; zbMATH DE number 1445399 (Why is no real title available?)
- Canceling most helpful total cuts for minimum cost network flow
- A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks
- An efficient network flow code for finding all minimum cost \(s-t\) cutsets
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- Maximum flow and minimum-cost flow in almost-linear time
This page was built for publication: Two strongly polynomial cut cancelling algorithms for minimum cost network flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689972)
