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):
Displayed 3 items.
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem (Q896282) (← links)
- A new approach for computing a most positive cut using the minimum flow algorithms (Q2493746) (← links)
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137) (← links)