Duality Theorems for a Continuous Analog of Ford-Fulkerson Flows in Networks

✍ Scribed by J.D. Chavez; L.H. Harper

• Publisher: Elsevier Science
• Year: 1993
• Tongue: English
• Weight: 594 KB
• Volume: 14
• Category: Article
• ISSN: 0196-8858
• DOI: 10.1006/aama.1993.1018

✦ Synopsis

T. C. Hu and K. Jacobs independently proposed continuous analogs of Ford-Fulkerson flows in networks. Their models are different, but both showed that there are difficulties in obtaining maxflow (=) mincut theorems. In this paper, using a definition of continuous networks which has already been shown to be natural and useful for solving combinatorial problems, we prove that there is no duality gap. O 1993.3 Academic Press. Inc.