Has three trucks 1 C&O transportation company with different capabilities (affectionately called ...
has three trucks 1 C&O transportation company with different capabilities (affectionately called Rooter, Scooter, and Tooter) and three moving jobs in different cities (Kitchener, London, and Missisauga). The following table shows the profit gained (in $1000s) if a given truck is used for the job in a given city. Your task is to find an allocation of the trucks to the three different cities to maxi mize profit. (a) Formulate this as an IP problem (b) Formulate it as a maximum matching prob lem. Solve the maximum matching problem using the minimum matching algorithm (c)
has three trucks 1 C&O transportation company with different capabilities (affectionately called Rooter, Scooter, and Tooter) and three moving jobs in different cities (Kitchener, London, and Missisauga). The following table shows the profit gained (in $1000s) if a given truck is used for the job in a given city. Your task is to find an allocation of the trucks to the three different cities to maxi mize profit. (a) Formulate this as an IP problem (b) Formulate it as a maximum matching prob lem. Solve the maximum matching problem using the minimum matching algorithm (c)