NETWORK FLOW AND SYSTEMS OF REPRESENTATIVES

Abstract

Two basic theorems of network flow theory are applied to determine necessary and sufficient conditions for (a) the existence of a system of representatives for a collection of subsets of a given set such that each element, a sub i of the given set occurs at least alpha sub i times in the system and at most beta sub i times (a system of restricted representatives), and (b) the existence of a common system of restricted representatives for two different collections of subsets of the given set.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 11, 1956
Accession Number
AD0605122

Entities

People

  • D. R. Fulkerson
  • L. R. Ford Jr.

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Hard Copy
  • Heuristic Methods
  • Inequalities
  • Integrals
  • Linear Programming
  • Mathematics
  • Military Research
  • Real Numbers
  • Simplex Method

Fields of Study

  • Mathematics

Readers

  • Control Systems Engineering.
  • Neural Network Machine Learning.
  • Regression Analysis.