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

  • Authors:

  • J. D. Chavez;L. H. Harper

  • Affiliations:

  • Calif State Coll San Bernardino, San Bernardino, CA 92407, USA and Univ Calif Riverside, Riverside, CA 92521, USA;Calif State Coll San Bernardino, San Bernardino, CA 92407, USA and Univ Calif Riverside, Riverside, CA 92521, USA

  • Venue:
  • Advances in Applied Mathematics
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.