Pages that link to "Item:Q4764587"
From MaRDI portal
The following pages link to Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587):
Displaying 5 items.
- A new strongly polynomial dual network simplex algorithm (Q1373742) (← links)
- A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q5415463) (← links)