The following pages link to Michael Holzhauser (Q281824):
Displaying 9 items.
- Budget-constrained minimum cost flows (Q281825) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- A network simplex method for the budget-constrained minimum cost flow problem (Q1751898) (← links)
- Maximum flows in generalized processing networks (Q2012883) (← links)
- An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
- Convex generalized flows (Q2352786) (← links)
- On the complexity and approximability of budget-constrained minimum cost flows (Q2361495) (← links)
- An FPTAS for the parametric knapsack problem (Q2361499) (← links)
- Generalized Network Improvement and Packing Problems (Q2963526) (← links)