Pages that link to "Item:Q3098331"
From MaRDI portal
The following pages link to Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications (Q3098331):
Displayed 5 items.
- Machine-part cell formation using biclustering (Q2356028) (← links)
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems (Q2423820) (← links)
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs (Q2811304) (← links)
- Fast algorithms for convex cost flow problems on circles, lines, and trees (Q2811315) (← links)
- Simple linear flow decomposition algorithms on trees, circles, and augmented trees (Q5326771) (← links)