The following pages link to (Q3683848):
Displaying 6 items.
- The maximum flow problem with disjunctive constraints (Q358660) (← links)
- On finding the K best cuts in a network (Q792224) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Methods for the one-dimensional space allocation problem (Q916571) (← links)
- An O(K.n**4) algorithm for finding the K best cuts in a network (Q1836587) (← links)
- A note on \(K\) best network flows (Q1897375) (← links)
