Pages that link to "Item:Q3798456"
From MaRDI portal
The following pages link to An <i>O</i> (n <sup>2</sup> (m + <i>N</i> log <i>n</i> )log <i>n</i> ) min-cost flow algorithm (Q3798456):
Displaying 11 items.
- Cycle-based reducibility of multi-index transport-type systems of linear inequalities (Q357096) (← links)
- Multiindex optimal production planning problems (Q612224) (← links)
- Three-index linear programs with nested structure (Q664295) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Multicommodity flows in tree-like networks (Q733946) (← links)
- The minimal average cost flow problem (Q1130071) (← links)
- Multi-index transport problems with decomposition structure (Q2261688) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
- (Q4031619) (← links)
- (Q4858969) (← links)
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems (Q6139374) (← links)
