The following pages link to (Q3318501):
Displaying 9 items.
- On an optimization problem with nested constraints (Q583110) (← links)
- Flow trees for vertex-capacitated networks (Q869579) (← links)
- Minimum cost flow algorithms for series-parallel networks (Q1061597) (← links)
- Greedy concepts for network flow problems (Q1088884) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
- Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints (Q3636879) (← links)
- (Q3835301) (← links)
- (Q4886100) (← links)