Pages that link to "Item:Q3967334"
From MaRDI portal
The following pages link to The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm (Q3967334):
Displaying 13 items.
- An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem (Q651729) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- A new algorithm for solving the feasibility problem of a network flow (Q990544) (← links)
- A dual algorithm for submodular flow problems (Q1183393) (← links)
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795) (← links)
- Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
- Computing maximum mean cuts (Q1329796) (← links)
- How to compute least infeasible flows (Q1373747) (← links)
- Exact bounds for steepest descent algorithms of $L$-convex function minimization (Q1785253) (← links)
- Dijkstra's algorithm and L-concave function maximization (Q2248748) (← links)
- A new approach for computing a most positive cut using the minimum flow algorithms (Q2493746) (← links)
- Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137) (← links)
