Health & Environmental Research Online (HERO)


Print Feedback Export to File
6300699 
Book/Book Chapter 
Chapter 5 shipments of coffee (transport network. the ford-fulkerson algorithm) 
1968 
Elsevier 
Amsterdam, Netherlands 
Mathematics in Science and Engineering 
47 
71-78 
English 
This chapter describes the problem of transport network with the help of the Mexican coffee export market. In the case study described in the chapter, about half of the excellent coffee grown in Mexico is sold abroad, and a large firm of Mexican exporters has stocks of the commodity stored at the ports of Veracruz, Tampico, Tuxpan and Campechy, for which orders have been received for shipments to the French ports of Dunkirk, Bordeaux, Saint-Nazaire, and Le Havre. Of these stocks, 120 tons are stored at Veracruz and 100 tons at each of the other three ports. The amounts to be delivered are 100 tons to Dunkirk, 80 to Bordeaux, 90 to Saint-Nazaire, and 150 to Le Havre. Assuming the transport costs to be the same between any two of these ports, one may satisfy the orders to a maximal degree with the help of the Ford–Fulkerson algorithm. 
Faure, R; Kaufmann, A 
Mathematics in Science and Engineering 
9780124023604