RECENT ADVANCES IN NETWORK FLOWS

Abstract

The present paper surveys important results in the theory of network flows which are not included in the book 'Flows in Networks' by Ford and Fulkerson. The survey is divided into three areas: (1) Shortest paths and minimal cost flows, (2) Multi-terminal flows, (3) Multi-commodity flows.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1967
Accession Number
AD0660505

Entities

People

  • T. C. Hu

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Commodities
  • Computations
  • Determinants (Mathematics)
  • Heuristic Methods
  • Linear Programming
  • Mathematics
  • Simplex Method
  • Terminals
  • United States
  • Wisconsin

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Theoretical Analysis.