Notes on Linear Programming

Part XLV A Network-Flow Feasibility Theorem and Combinatorial Applications

D. R. Fulkerson

ResearchPublished 1958

An establishment of necessary and sufficient conditions for the existence of a flow in a network (e.g., a railway network) satisfying prescribed bounds on the net flow leaving certain nodes and entering other nodes. These conditions are applied to the study of combinatorial problems concerning matrices of zeros and ones, subgraphs of a directed graph, and systems of distinct representatives.

Topics

Document Details

  • Copyright: RAND Corporation
  • Availability: Web Only
  • Year: 1958
  • Pages: 30
  • Document Number: RM-2159

Citation

Chicago Manual of Style

Fulkerson, D. R., Notes on Linear Programming: Part XLV A Network-Flow Feasibility Theorem and Combinatorial Applications. Santa Monica, CA: RAND Corporation, 1958. https://www.rand.org/pubs/research_memoranda/RM2159.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.