Pages that link to "Item:Q5936466"
From MaRDI portal
The following pages link to A cycle augmentation algorithm for minimum cost multicommodity flows on a ring (Q5936466):
Displaying 6 items.
- Upgrading edge-disjoint paths in a ring (Q429680) (← links)
- An augmented Lagrangian algorithm for large scale multicommodity routing (Q1424783) (← links)
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012) (← links)
- Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem (Q4385161) (← links)
- (Q5020877) (← links)
- Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs (Q5449668) (← links)