Which edge, when removed, results in the lowest maximum flow from s to t?
- Edge with cost 1
- Edge with cost 2
- Edge with cost 3
- Edge with cost 4
- None of the above
Instructions for question creators: (1) do not include the answer; (2) the last alternative must be: "E, None of the above"; (3) at the end, add "Original idea by: " and your name.
Which edge, when removed, results in the lowest maximum flow from s to t?
Original idea by: Rubens de Castro Pereira
Goods are
transported by trucks from two orchards to three retailers. Some of the
orchards cannot ship directly to some of the retailers. The capacities of the routes are limited by the number of trucks available and the number of trips
made daily. The following table shows in the margins the
daily amounts of supply at the orchards and demand at the farms. The cell entries of the table specify the daily capacities of the
associated routes. All figures are in number of container boxes.
Determine the maximum amount of container boxes that can be shipped daily from orchards to retailers.
A. 24
B. 10
C. 54
D. 17
E. None of the above.
Original idea by: Muhammad Idrees
Consider the flow network in the figure, where s and t are the source and sink, respectively, with an initial flow though paths in blue and red. Choose the alternative with the pair of augmenting paths that together push the largest amount of flow in the corresponding residual graph.
Original idea by: Lucca Bavia
Original idea by: Gabriel Oliveira
A company launched a new gadget C to be produced globally for North American and South American markets. The company uses just-in-time as ...