DOI: 10.1287/opre.14.4.619. Networks and Basic Solutions

10.1287/opre.14.4.619

Crossref journal-article

Institute for Operations Research and the Management Sciences (INFORMS)

Operations Research (109)

Abstract

A labeling procedure which could be used to carry out the steps of the simplex algorithm for a network flow problem is given. A modification of the simplex algorithm for the maximum flow problem is suggested which is equivalent to the Ford-Fulkerson algorithm if the solutions are kept basic in the latter. A procedure to keep the solutions basic in the Ford-Fulkerson algorithm is given. An example of a flow with gains problem with integer capacities and gains is given for which the usual labeling procedure may not lead to an optimum solution if the solutions are not kept basic. Extension of the network flow techniques to flows with gains is discussed.

Bibliography

Johnson, E. L. (1966). Networks and Basic Solutions. Operations Research, 14(4), 619â623.

Authors 1

Ellis L. Johnson (first)

References 0 Referenced 77

None

Dates

Type	When
Created	16 years, 9 months ago (Nov. 8, 2008, 8:45 a.m.)
Deposited	2 years, 5 months ago (April 2, 2023, 12:20 p.m.)
Indexed	3 weeks, 3 days ago (Aug. 12, 2025, 6:23 p.m.)
Issued	59 years, 1 month ago (Aug. 1, 1966)
Published	59 years, 1 month ago (Aug. 1, 1966)
Published Print	59 years, 1 month ago (Aug. 1, 1966)

Funders 0

None

BibTeX

@article{Johnson_1966, title={Networks and Basic Solutions}, volume={14}, ISSN={1526-5463}, url={http://dx.doi.org/10.1287/opre.14.4.619}, DOI={10.1287/opre.14.4.619}, number={4}, journal={Operations Research}, publisher={Institute for Operations Research and the Management Sciences (INFORMS)}, author={Johnson, Ellis L.}, year={1966}, month=aug, pages={619–623} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        8,
        12
      ]
    ],
    "date-time": "2025-08-12T22:23:46Z",
    "timestamp": 1755037426728
  },
  "reference-count": 0,
  "publisher": "Institute for Operations Research and the Management Sciences (INFORMS)",
  "issue": "4",
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        1966,
        8
      ]
    ]
  },
  "abstract": "<jats:p> A labeling procedure which could be used to carry out the steps of the simplex algorithm for a network flow problem is given. A modification of the simplex algorithm for the maximum flow problem is suggested which is equivalent to the Ford-Fulkerson algorithm if the solutions are kept basic in the latter. A procedure to keep the solutions basic in the Ford-Fulkerson algorithm is given. An example of a flow with gains problem with integer capacities and gains is given for which the usual labeling procedure may not lead to an optimum solution if the solutions are not kept basic. Extension of the network flow techniques to flows with gains is discussed. </jats:p>",
  "DOI": "10.1287/opre.14.4.619",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2008,
        11,
        8
      ]
    ],
    "date-time": "2008-11-08T13:45:52Z",
    "timestamp": 1226151952000
  },
  "page": "619-623",
  "source": "Crossref",
  "is-referenced-by-count": 77,
  "title": "Networks and Basic Solutions",
  "prefix": "10.1287",
  "volume": "14",
  "author": [
    {
      "given": "Ellis L.",
      "family": "Johnson",
      "sequence": "first",
      "affiliation": [
        {
          "name": "Yale University, New Haven, Connecticut"
        }
      ]
    }
  ],
  "member": "109",
  "container-title": "Operations Research",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "https://pubsonline.informs.org/doi/pdf/10.1287/opre.14.4.619",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2023,
        4,
        2
      ]
    ],
    "date-time": "2023-04-02T16:20:21Z",
    "timestamp": 1680452421000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "https://pubsonline.informs.org/doi/10.1287/opre.14.4.619"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1966,
        8
      ]
    ]
  },
  "references-count": 0,
  "journal-issue": {
    "issue": "4",
    "published-print": {
      "date-parts": [
        [
          1966,
          8
        ]
      ]
    }
  },
  "alternative-id": [
    "10.1287/opre.14.4.619"
  ],
  "URL": "http://dx.doi.org/10.1287/opre.14.4.619",
  "relation": {},
  "ISSN": [
    "0030-364X",
    "1526-5463"
  ],
  "subject": [],
  "container-title-short": "Operations Research",
  "published": {
    "date-parts": [
      [
        1966,
        8
      ]
    ]
  }
}