The following pages link to (Q3318501):
Displayed 4 items.
- On an optimization problem with nested constraints (Q583110) (← links)
- Minimum cost flow algorithms for series-parallel networks (Q1061597) (← links)
- Greedy concepts for network flow problems (Q1088884) (← links)
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)