The following pages link to (Q4875223):
Displaying 12 items.
- On maximum flows in polyhedral domains (Q918212) (← links)
- Protection of flows under targeted attacks (Q1727948) (← links)
- A faster polynomial algorithm for the constrained maximum flow problem (Q1761207) (← links)
- Efficient algorithms for abstract flow with partial switching (Q2079298) (← links)
- Abstract network flow with intermediate storage for evacuation planning (Q2103018) (← links)
- Abstract flows over time: a first step towards solving dynamic packing problems (Q2250460) (← links)
- Partial contraflow with path reversals for evacuation planning (Q2288951) (← links)
- Efficient continuous contraflow algorithms for evacuation planning problems (Q2400022) (← links)
- A Primal-Dual Algorithm for Weighted Abstract Cut Packing (Q3009773) (← links)
- A Polynomial Algorithm for Weighted Abstract Flow (Q3503842) (← links)
- (Q5020876) (← links)
- A strongly polynomial algorithm for generalized flow maximization (Q5259600) (← links)