Pages that link to "Item:Q2361495"
From MaRDI portal
The following pages link to On the complexity and approximability of budget-constrained minimum cost flows (Q2361495):
Displaying 6 items.
- Budget-constrained minimum cost flows (Q281825) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- Improving post-disaster road network accessibility by strengthening links against failures (Q1750446) (← links)
- A network simplex method for the budget-constrained minimum cost flow problem (Q1751898) (← links)
- (Q3347609) (← links)
- The budgeted minimum cost flow problem with unit upgrading cost (Q4565772) (← links)