FEASIBILITY OF TWO COMMODITY NETWORK FLOWS,

Abstract

The paper considers the problem of feasibility of integer flows in a two commodity network with integral capacities. The main result of the paper is conditions under which, for two nonnegative integers a and b, there exists a two commodity flow, where the flow of the first commodity is of size a and the second flow of size b. If such numbers are realizable as flow values, then an algorithm is indicated for finding the actual paths in the network. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1965
Accession Number
AD0624501

Entities

People

  • A. Whinston
  • B. Rothschild

Organizations

  • University of Virginia

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Commodities
  • Integrals
  • Mathematics

Readers

  • Fluid Mechanics and Fluid Dynamics.
  • Graph Algorithms and Convex Optimization.
  • Logistics and Supply Chain Management.