Pages that link to "Item:Q2757624"
From MaRDI portal
The following pages link to Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow (Q2757624):
Displaying 8 items.
- About the minimum mean cycle-canceling algorithm (Q499347) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem (Q896282) (← links)
- Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
- MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles (Q2178342) (← links)
- A new approach for computing a most positive cut using the minimum flow algorithms (Q2493746) (← links)
- Canceling most helpful total cuts for minimum cost network flow (Q5285477) (← links)
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137) (← links)
