Pages that link to "Item:Q5957566"
From MaRDI portal
The following pages link to A polynomial dual simplex algorithm fot the generalized circulation problem. (Q5957566):
Displayed 4 items.
- Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
- A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains (Q5321689) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)