Pages that link to "Item:Q2573394"
From MaRDI portal
The following pages link to The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving (Q2573394):
Displaying 6 items.
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
- A multicommodity network flow application for the capacitated minimal spanning tree problem (Q1890671) (← links)
- Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks (Q2757586) (← links)
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems (Q4427382) (← links)
- Flows in strongly regular periodic dynamic resource networks (Q5037475) (← links)
- An efficient approach to optimization of semi‐stable routing in multicommodity flow networks (Q6087135) (← links)