, 03.12.2019 05:40 sherlock19

You are organizing a dinner with n di erent groups of friends, with each group composed of gi members with i 2 f1; : : : ; ng. you have m tables each for r people, and you want want to impose that all friends from the same group should be seated in di erent tables. in this way you will obligate your friends ( nally) to chat with people who does not belong to their closest groups. show (graphically) that using a maximum ow formulation we can nd a feasible arrangement of friends to tables that satisfy the rule mentioned above, or show that it is not possible. hint: imagine that someone solves the maximum flow problem (that you need to find) and tells you what's the maximum flow. using that number, how can you know if it was possible to nd the arrangement suggested in the problem statement or not.

Another question on Mathematics

Mathematics, 04.02.2019 22:20
Find the magnitude of the torque about p if an f = 80-lb force is applied as shown. (round your answer to the nearest whole number.) ft-lb
Mathematics, 04.02.2019 17:11
What is the order of magnitude for the number of liters in a large bottle of soda served at a party
Student price tickets to a movie are $1 and non student tickets are$2 . 350 tickets are sold and the total amount made is \$450. there were 250 student tickets sold . true or false .
For g(x) = 5x - 3 and h(x) = $$\sqrt{x}$$, find (g · h)(4)