scientific article; zbMATH DE number 150473
From MaRDI portal
Publication:4031619
Recommendations
- An O(nm^ 2) time algorithm for solving minimal cost network flow problems
- An O (n 2 (m + N log n )log n ) min-cost flow algorithm
- Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
- A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM
- On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows
- scientific article; zbMATH DE number 3864952
- scientific article; zbMATH DE number 1927152
- scientific article; zbMATH DE number 1263274
- Complexity and approximability of the maximum flow problem with minimum quantities
- scientific article; zbMATH DE number 1918689
Cited in
(13)- Efficient optimization of certain functionals in a hypercube
- An algorithm for solving the transport problem on network with concave cost functions of flow on edges
- An alternate linear algorithm for the minimum flow problem
- A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
- An O(nm^ 2) time algorithm for solving minimal cost network flow problems
- scientific article; zbMATH DE number 29758 (Why is no real title available?)
- The out‐of‐kilter algorithm for solving network problems
- Using network-flow techniques to solve an optimization problem from surface-physics
- Minimum cost flow problem
- scientific article; zbMATH DE number 828003 (Why is no real title available?)
- An algorithm for labeling network flow problems
- An efficient algorithm for solving minimum cost flow problem with complementarity slack conditions
- An efficient algorithm for the minimum capacity cut problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031619)
