The Valley Times and World News publishes and delivers a morning newspaper 7 days a week. The bundled papers are delivered by trucks to a number of area communities where they are picked up by carriers at a central location in the community, who then deliver the individual newspapers to customers along various predetermined routes. The papers arrive at the central distribution location around 6 A.M., and they must be delivered by 8 A.M. The routes include homes, stores, restaurants, and newspaper machines. One community, Hannah Creek, has 10 routes, and six available paper carriers, who have requested a delivery contract. The following table shows the time (in minutes) required to deliver the newspapers along each route, the number of papers delivered on each route, and the vehicle capacity (in number of papers) of each carrier: Carrier A B C D E F Vehicle capacity 600 720 450 510 660 550 Route 1 2 3 4 5 6 7 8 9 10 Time (mins) 29 35 15 35 20 23 35 40 45 50 Papers delivered 200 240 110 90 65 135 80 170 150 270 Formulate and solve a linear integer programming model that will minimize the total number of carriers needed to make the deliveries and that will determine which carrier will be assigned each route and the total number of papers delivered by each of the selected car.