DOI: 10.1007/bfb0121089. An efficient implementation of the network simplex method

An efficient implementation of the network simplex method

10.1007/bfb0121089

Crossref book-chapter

Springer Berlin Heidelberg

Mathematical Programming Studies (297)

Bibliography

Grigoriadis, M. D. (1986). An efficient implementation of the network simplex method. Netflow at Pisa, 83â111.

Authors 1

M. D. Grigoriadis (first)

References 49 Referenced 62

H.A. Aashtiani and T.L. Magnanti, “Implementing primal-dual network flow algorithms”, ORC Report 055-76, M.I.T. (Cambridge, MA, 1976). / Implementing primal-dual network flow algorithms / ORC Report 055-76 by H.A. Aashtiani (1976)
R. Barr, F. Glover and D. Klingman, “An improved version of the out-of-kilter method and a comparative study of computer codes”, Mathematical Programming 7 (1974) 60–86. (10.1007/BF01585504) / Mathematical Programming by R. Barr (1974)
D.P. Bertsekas, “A unified framework for minimum cost network flow problems”, Technical Report LIDS-P-1245-A, M.I.T. (Cambridge, MA, 1982). / A unified framework for minimum cost network flow problems / Technical Report LIDS-P-1245-A by D.P. Bertsekas (1982)
D.P. Bertsekas and P. Tseng, “Relaxation methods for minimum cost network flow problems”, Technical Report LIDS-P-1339, M.I.T. (Cambridge, MA, 1983). / Relaxation methods for minimum cost network flow problems / Technical Report LIDS-P-1339 by D.P. Bertsekas (1983)
R.G. Bland, “New finite pivoting rules for the simplex method”, Mathematics of Operations Research 2 (1977) 103–107. (10.1287/moor.2.2.103) / Mathematics of Operations Research by R.G. Bland (1977)
R.G. Bland and D.L. Jensen, private communication (1982). Also see D.L. Jensen, “Combinatorial augmentation methods: coloring and duality”, Ph.D. Thesis, School of OR and IE, Cornell University (Ithaca, NY, 1985).
G.H. Bradley, G.G. Brown and G.W. Graves, “Design and implementation of large scale primal transshipment algorithms”, Management Science 24 (1977) 1–34. (10.1287/mnsc.24.1.1) / Management Science by G.H. Bradley (1977)
R.G. Busacker and P.J. Gowen, “A procedure for determining a family of minimal cost network flow patterns”, ORO Technical Report 15, Operations Research Office, Johns Hopkins University (Baltimore, MD, 1961). / A procedure for determining a family of minimal cost network flow patterns / ORO Technical Report by R.G. Busacker (1961)
A. Charnes, D. Karney, D. Klingman and J. Stutz, “Past, present and future of large scale transshipment computer codes and applications”, Computers and Operations Research 2 (1975) 71–81. (10.1016/0305-0548(75)90010-6) / Computers and Operations Research by A. Charnes (1975)
W.H. Cunningham, “A network simplex method”, Mathematical Programming 1 (1976) 105–116. (10.1007/BF01580379) / Mathematical Programming by W.H. Cunningham (1976)
W.H. Cunningham, “Theoretical properties of the network simplex methods”, Mathematics of Operations Research 4 (1979) 196–208. (10.1287/moor.4.2.196) / Mathematics of Operations Research by W.H. Cunningham (1979)
G.B. Dantzig, “Application of the simplex method to a transportation problem”, in: T.C. Koopmans, ed., Activity analysis of production and allocation (Wiley, New York, 1951) pp. 359–373. / Activity analysis of production and allocation by G.B. Dantzig (1951)
G.B. Dantzig, “Upper bounds, secondary constraints and block triangularity in linear programming”, Econometrica 23 (1955) 174–183. (10.2307/1907876) / Econometrica by G.B. Dantzig (1955)
V. Malhotra, M. Kumar and S. Maheshwari, “An O(|V|3) algorithm for finding maximum flows in
DECSYSTEM-10/DECSYSTEM-20 processor reference manual, Publication AD-H391A-T1 (Digital Equipment Corporation, Marlboro, MA, June 1982) pp. 3.56–58. Also see “METER%” in TOPS-20 monitor calls reference manual, Publication AA-4166E-T1 (Digital Equipment corporation, Marlboro, MA, December 1982) pp. 3.20.
E.A. Dinic, “Algorithm for solution of a problem of maximum flow in network with power estimation”, Soviet Mathematics Doklady 11 (1970) 1277–1280. / Soviet Mathematics Doklady by E.A. Dinic (1970)
J. Edmonds and R.M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems”, Journal of the ACM 19 (1972) 248–264. (10.1145/321694.321699) / Journal of the ACM by J. Edmonds (1972)
J. Edmonds and D.L. Jensen, private communication (1982).
D.R. Fulkerson and G.B. Dantzig, “Computations of maximal flows in networks”, Naval Research Logistics Quarterly 2 (1955) 277–283. (10.1002/nav.3800020407) / Naval Research Logistics Quarterly by D.R. Fulkerson (1955)
D.R. Fulkerson, “An out-of-kilter method for minimal-cost flow problems”, SIAM Journal on Applied Mathematics 9 (1961) 18–27. (10.1137/0109002) / SIAM Journal on Applied Mathematics by D.R. Fulkerson (1961)
B.J. Gassner, “Cycling in the transportation problem”, Naval Research Logisics Quarterly 11 (1964) 43–58. (10.1002/nav.3800110104) / Naval Research Logisics Quarterly by B.J. Gassner (1964)
S.I. Gass, Linear programming—Methods and applications (McGraw-Hill, New York, 1975). / Linear programming—Methods and applications by S.I. Gass (1975)
F. Glover, D. Karney and D. Klingman, “Implementation and computational comparisons of primal, dual, and primal-dual computer codes for minimum cost network flow problems”, Networks 4 (1974) 191–212. (10.1002/net.3230040302) / Networks by F. Glover (1974)
F. Glover, D. Karney, D. Klingman and A. Napier, “A comparison of computational times for various starting procedures, basis change criteria and solution algorithms for transportation problems”, Management Science 20 (1974) 793–819. (10.1287/mnsc.20.5.783) / Management Science by F. Glover (1974)
D. Goldfarb and J.K. Reid, “A practicable steepest edge simplex algorithm”, Mathematical Programming 12 (1977) 361–371. (10.1007/BF01593804) / Mathematical Programming by D. Goldfarb (1977)
D. Goldfarb, “Steepest edge simplex algorithms for network flow problems”, Technical Report RC 6649, IBM T.J. Watson Research Center (Yorktown Heights, NY, 1977). / Steepest edge simplex algorithms for network flow problems / Technical Report RC by D. Goldfarb (1977)
D. Goldfarb and M.D. Grigoriadis, “An efficient steepest-edge algorithm for maximum flow problems”, Tenth International Symposium on Mathematical Programming, Montreal, Canada (1979).
M.D. Grigoriadis, “Minimum cost multistage multicommodity network flows”, NATO Conference on Applications of Optimization Methods for Large-scale Resource Allocation Problems, Elsinore, Denmark (July 1971).
M.D. Grigoriadis, “Algorithms for the minimum cost single and multicommodity network flow problems”, Lecture notes, Summer course in Combinatorial Optimization, SOGESTA, Urbino, Italy (1978). / Algorithms for the minimum cost single and multicommodity network flow problems / Lecture notes, Summer course in Combinatorial Optimization by M.D. Grigoriadis (1978)
M.D. Grigoriadis and T. Hsu, “The Rutgers minimum cost network flow subroutines”, SIGMAP Bulletin of the ACM 26 (1979) 17–18. / SIGMAP Bulletin of the ACM by M.D. Grigoriadis (1979)
E. Horowitz and S.J. Sahni, Fundamentals of computer algorithms (Computer Science Press, Rockville, MD, 1978). / Fundamentals of computer algorithms by E. Horowitz (1978)
P.A. Jensen and J.W. Barnes, Network flow programming (Wiley, New York, 1980). / Network flow programming by P.A. Jensen (1980)
E.L. Johnson, “Networks and basic solutions”, Operations Research 14 (1966) 619–623. (10.1287/opre.14.4.619) / Operations Research by E.L. Johnson (1966)
C.L. Hedrick, “Fortran-X: An extended memory version of the DECSYSTEM-20 Fortran Version 7”, unpublished LCSR Report, Rutgers University (New Brunswick, NJ, November 1983). / Fortran-X: An extended memory version of the DECSYSTEM-20 Fortran Version 7 by C.L. Hedrick (1983)
D. Karney and D. Klingman, “Implementation and computational study on an in-core out-of-core primal network code”, Operations Research 24 (1976) 1056–1077. (10.1287/opre.24.6.1056) / Operations Research by D. Karney (1976)
J.L. Kennington and R.V. Helgason, Algorithms for network programming (Wiley, New York, 1980). / Algorithms for network programming by J.L. Kennington (1980)
M. Klein, “A primal method for minimal cost flows”, Management Science 14 (1967) 205–220. (10.1287/mnsc.14.3.205) / Management Science by M. Klein (1967)
D. Klingman, A. Napier and J. Stutz, “NETGEN—A program for generating large-scale (un)capacitated assignment, transportation and minimum cost flow network problems”, Management Science 20 (1974) 814–821. (10.1287/mnsc.20.5.814) / Management Science by D. Klingman (1974)
D.E. Knuth, The art of computer programming—Volume 1 (Addison-Wesley, Reading, MA, 1973). / The art of computer programming by D.E. Knuth (1973)
E.L. Lawler, Combinatorial optimization: Networks and matroids (Holt, Rinehart and Winston, New York, 1976). / Combinatorial optimization: Networks and matroids by E.L. Lawler (1976)
V. Malhotra, M. Kumar and S. Maheshwari, “An O(|V|3) algorithm for finding maximum flows in networks”, Information Processing Letters 7 (1978) 277–278. (10.1016/0020-0190(78)90016-9) / Information Processing Letters by V. Malhotra (1978)
J. Mulvey, “Testing a large-scale network optimization program”, Mathematical Programming 15 (1978) 291–314. (10.1007/BF01609034) / Mathematical Programming by J. Mulvey (1978)
J. Mulvey, “Pivot strategies for primal-simplex network codes”, Journal of the ACM 25 (1978) 266–270. (10.1145/322063.322070) / Journal of the ACM by J. Mulvey (1978)
A. Orden, “The transshipment problem”, Management Science 2 (1956) 276–285. (10.1287/mnsc.2.3.276) / Management Science by A. Orden (1956)
J.B. Orlin, “Polynomial time pivoting procedures for minimum cost network flow problems”, TIMS/ORSA National Meeting, San Francisco, CA, 17 May 1984. Also see “On the simplex algorithm for networks”, Sloan W.P. 1467–1483 (rev. May 1984), M.I.T., Cambridge, MA.
H. Rock, “Scaling techniques for minimal cost network flows”, in: U. Page, ed., Discrete structures and algorithms (Carl Hanser, Munchen, 1980) pp. 181–191. / Discrete structures and algorithms by H. Rock (1980)
V. Srinivasan and G.L. Thompson, “Accelerated algorithms for labeling and relabeling trees, with applications to distribution problems”, Journal of the ACM 19 (1972) 712–726. (10.1145/321724.321734) / Journal of the ACM by V. Srinivasan (1972)
E. Tardos, “A strongly polynomial minimum cost circulation algorithm”, Combinatorica (to appear May 1985). (10.1007/BF02579369)
N. Zadeh, “A bad network problem for the simplex method and other minimum cost flow algorithms”, Mathematical Programming 5 (1973) 255–266. (10.1007/BF01580132) / Mathematical Programming by N. Zadeh (1973)

Dates

Type	When
Created	13 years, 6 months ago (Feb. 14, 2012, 6:04 p.m.)
Deposited	4 years, 8 months ago (Dec. 9, 2020, 5:01 p.m.)
Indexed	3 months, 1 week ago (May 18, 2025, 2:06 a.m.)
Issued	39 years, 7 months ago (Jan. 1, 1986)
Published	39 years, 7 months ago (Jan. 1, 1986)
Published Online	16 years, 5 months ago (Feb. 26, 2009)
Published Print	39 years, 7 months ago (Jan. 1, 1986)

Funders 0

None

BibTeX

@inbook{Grigoriadis_1986, title={An efficient implementation of the network simplex method}, ISBN={9783642009235}, ISSN={0303-3929}, url={http://dx.doi.org/10.1007/bfb0121089}, DOI={10.1007/bfb0121089}, booktitle={Netflow at Pisa}, publisher={Springer Berlin Heidelberg}, author={Grigoriadis, M. D.}, year={1986}, pages={83–111} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        5,
        18
      ]
    ],
    "date-time": "2025-05-18T06:06:14Z",
    "timestamp": 1747548374268
  },
  "publisher-location": "Berlin, Heidelberg",
  "reference-count": 49,
  "publisher": "Springer Berlin Heidelberg",
  "isbn-type": [
    {
      "type": "print",
      "value": "9783642009228"
    },
    {
      "type": "electronic",
      "value": "9783642009235"
    }
  ],
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        1986
      ]
    ]
  },
  "DOI": "10.1007/bfb0121089",
  "type": "book-chapter",
  "created": {
    "date-parts": [
      [
        2012,
        2,
        14
      ]
    ],
    "date-time": "2012-02-14T23:04:56Z",
    "timestamp": 1329260696000
  },
  "page": "83-111",
  "source": "Crossref",
  "is-referenced-by-count": 62,
  "title": "An efficient implementation of the network simplex method",
  "prefix": "10.1007",
  "author": [
    {
      "given": "M. D.",
      "family": "Grigoriadis",
      "sequence": "first",
      "affiliation": []
    }
  ],
  "member": "297",
  "published-online": {
    "date-parts": [
      [
        2009,
        2,
        26
      ]
    ]
  },
  "reference": [
    {
      "key": "5_CR1",
      "series-title": "ORC Report 055-76",
      "volume-title": "Implementing primal-dual network flow algorithms",
      "author": "H.A. Aashtiani",
      "year": "1976",
      "unstructured": "H.A. Aashtiani and T.L. Magnanti, \u201cImplementing primal-dual network flow algorithms\u201d, ORC Report 055-76, M.I.T. (Cambridge, MA, 1976)."
    },
    {
      "key": "5_CR2",
      "doi-asserted-by": "publisher",
      "first-page": "60",
      "DOI": "10.1007/BF01585504",
      "volume": "7",
      "author": "R. Barr",
      "year": "1974",
      "unstructured": "R. Barr, F. Glover and D. Klingman, \u201cAn improved version of the out-of-kilter method and a comparative study of computer codes\u201d, Mathematical Programming 7 (1974) 60\u201386.",
      "journal-title": "Mathematical Programming"
    },
    {
      "key": "5_CR3",
      "series-title": "Technical Report LIDS-P-1245-A",
      "volume-title": "A unified framework for minimum cost network flow problems",
      "author": "D.P. Bertsekas",
      "year": "1982",
      "unstructured": "D.P. Bertsekas, \u201cA unified framework for minimum cost network flow problems\u201d, Technical Report LIDS-P-1245-A, M.I.T. (Cambridge, MA, 1982)."
    },
    {
      "key": "5_CR4",
      "series-title": "Technical Report LIDS-P-1339",
      "volume-title": "Relaxation methods for minimum cost network flow problems",
      "author": "D.P. Bertsekas",
      "year": "1983",
      "unstructured": "D.P. Bertsekas and P. Tseng, \u201cRelaxation methods for minimum cost network flow problems\u201d, Technical Report LIDS-P-1339, M.I.T. (Cambridge, MA, 1983)."
    },
    {
      "key": "5_CR5",
      "doi-asserted-by": "publisher",
      "first-page": "103",
      "DOI": "10.1287/moor.2.2.103",
      "volume": "2",
      "author": "R.G. Bland",
      "year": "1977",
      "unstructured": "R.G. Bland, \u201cNew finite pivoting rules for the simplex method\u201d, Mathematics of Operations Research 2 (1977) 103\u2013107.",
      "journal-title": "Mathematics of Operations Research"
    },
    {
      "key": "5_CR6",
      "unstructured": "R.G. Bland and D.L. Jensen, private communication (1982). Also see D.L. Jensen, \u201cCombinatorial augmentation methods: coloring and duality\u201d, Ph.D. Thesis, School of OR and IE, Cornell University (Ithaca, NY, 1985)."
    },
    {
      "key": "5_CR7",
      "doi-asserted-by": "publisher",
      "first-page": "1",
      "DOI": "10.1287/mnsc.24.1.1",
      "volume": "24",
      "author": "G.H. Bradley",
      "year": "1977",
      "unstructured": "G.H. Bradley, G.G. Brown and G.W. Graves, \u201cDesign and implementation of large scale primal transshipment algorithms\u201d, Management Science 24 (1977) 1\u201334.",
      "journal-title": "Management Science"
    },
    {
      "key": "5_CR8",
      "series-title": "ORO Technical Report",
      "volume-title": "A procedure for determining a family of minimal cost network flow patterns",
      "author": "R.G. Busacker",
      "year": "1961",
      "unstructured": "R.G. Busacker and P.J. Gowen, \u201cA procedure for determining a family of minimal cost network flow patterns\u201d, ORO Technical Report 15, Operations Research Office, Johns Hopkins University (Baltimore, MD, 1961)."
    },
    {
      "key": "5_CR9",
      "doi-asserted-by": "publisher",
      "first-page": "71",
      "DOI": "10.1016/0305-0548(75)90010-6",
      "volume": "2",
      "author": "A. Charnes",
      "year": "1975",
      "unstructured": "A. Charnes, D. Karney, D. Klingman and J. Stutz, \u201cPast, present and future of large scale transshipment computer codes and applications\u201d, Computers and Operations Research 2 (1975) 71\u201381.",
      "journal-title": "Computers and Operations Research"
    },
    {
      "key": "5_CR10",
      "doi-asserted-by": "publisher",
      "first-page": "105",
      "DOI": "10.1007/BF01580379",
      "volume": "1",
      "author": "W.H. Cunningham",
      "year": "1976",
      "unstructured": "W.H. Cunningham, \u201cA network simplex method\u201d, Mathematical Programming 1 (1976) 105\u2013116.",
      "journal-title": "Mathematical Programming"
    },
    {
      "key": "5_CR11",
      "doi-asserted-by": "publisher",
      "first-page": "196",
      "DOI": "10.1287/moor.4.2.196",
      "volume": "4",
      "author": "W.H. Cunningham",
      "year": "1979",
      "unstructured": "W.H. Cunningham, \u201cTheoretical properties of the network simplex methods\u201d, Mathematics of Operations Research 4 (1979) 196\u2013208.",
      "journal-title": "Mathematics of Operations Research"
    },
    {
      "key": "5_CR12",
      "first-page": "359",
      "volume-title": "Activity analysis of production and allocation",
      "author": "G.B. Dantzig",
      "year": "1951",
      "unstructured": "G.B. Dantzig, \u201cApplication of the simplex method to a transportation problem\u201d, in: T.C. Koopmans, ed., Activity analysis of production and allocation (Wiley, New York, 1951) pp. 359\u2013373."
    },
    {
      "key": "5_CR13",
      "doi-asserted-by": "publisher",
      "first-page": "174",
      "DOI": "10.2307/1907876",
      "volume": "23",
      "author": "G.B. Dantzig",
      "year": "1955",
      "unstructured": "G.B. Dantzig, \u201cUpper bounds, secondary constraints and block triangularity in linear programming\u201d, Econometrica 23 (1955) 174\u2013183.",
      "journal-title": "Econometrica"
    },
    {
      "key": "5_CR14",
      "unstructured": "V. Malhotra, M. Kumar and S. Maheshwari, \u201cAn O(|V|3) algorithm for finding maximum flows in"
    },
    {
      "key": "5_CR15",
      "unstructured": "DECSYSTEM-10/DECSYSTEM-20 processor reference manual, Publication AD-H391A-T1 (Digital Equipment Corporation, Marlboro, MA, June 1982) pp. 3.56\u201358. Also see \u201cMETER%\u201d in TOPS-20 monitor calls reference manual, Publication AA-4166E-T1 (Digital Equipment corporation, Marlboro, MA, December 1982) pp. 3.20."
    },
    {
      "key": "5_CR16",
      "first-page": "1277",
      "volume": "11",
      "author": "E.A. Dinic",
      "year": "1970",
      "unstructured": "E.A. Dinic, \u201cAlgorithm for solution of a problem of maximum flow in network with power estimation\u201d, Soviet Mathematics Doklady 11 (1970) 1277\u20131280.",
      "journal-title": "Soviet Mathematics Doklady"
    },
    {
      "key": "5_CR17",
      "doi-asserted-by": "publisher",
      "first-page": "248",
      "DOI": "10.1145/321694.321699",
      "volume": "19",
      "author": "J. Edmonds",
      "year": "1972",
      "unstructured": "J. Edmonds and R.M. Karp, \u201cTheoretical improvements in algorithmic efficiency for network flow problems\u201d, Journal of the ACM 19 (1972) 248\u2013264.",
      "journal-title": "Journal of the ACM"
    },
    {
      "key": "5_CR18",
      "unstructured": "J. Edmonds and D.L. Jensen, private communication (1982)."
    },
    {
      "key": "5_CR19",
      "doi-asserted-by": "publisher",
      "first-page": "277",
      "DOI": "10.1002/nav.3800020407",
      "volume": "2",
      "author": "D.R. Fulkerson",
      "year": "1955",
      "unstructured": "D.R. Fulkerson and G.B. Dantzig, \u201cComputations of maximal flows in networks\u201d, Naval Research Logistics Quarterly 2 (1955) 277\u2013283.",
      "journal-title": "Naval Research Logistics Quarterly"
    },
    {
      "key": "5_CR20",
      "doi-asserted-by": "publisher",
      "first-page": "18",
      "DOI": "10.1137/0109002",
      "volume": "9",
      "author": "D.R. Fulkerson",
      "year": "1961",
      "unstructured": "D.R. Fulkerson, \u201cAn out-of-kilter method for minimal-cost flow problems\u201d, SIAM Journal on Applied Mathematics 9 (1961) 18\u201327.",
      "journal-title": "SIAM Journal on Applied Mathematics"
    },
    {
      "key": "5_CR21",
      "doi-asserted-by": "publisher",
      "first-page": "43",
      "DOI": "10.1002/nav.3800110104",
      "volume": "11",
      "author": "B.J. Gassner",
      "year": "1964",
      "unstructured": "B.J. Gassner, \u201cCycling in the transportation problem\u201d, Naval Research Logisics Quarterly 11 (1964) 43\u201358.",
      "journal-title": "Naval Research Logisics Quarterly"
    },
    {
      "key": "5_CR22",
      "volume-title": "Linear programming\u2014Methods and applications",
      "author": "S.I. Gass",
      "year": "1975",
      "unstructured": "S.I. Gass, Linear programming\u2014Methods and applications (McGraw-Hill, New York, 1975)."
    },
    {
      "key": "5_CR23",
      "doi-asserted-by": "publisher",
      "first-page": "191",
      "DOI": "10.1002/net.3230040302",
      "volume": "4",
      "author": "F. Glover",
      "year": "1974",
      "unstructured": "F. Glover, D. Karney and D. Klingman, \u201cImplementation and computational comparisons of primal, dual, and primal-dual computer codes for minimum cost network flow problems\u201d, Networks 4 (1974) 191\u2013212.",
      "journal-title": "Networks"
    },
    {
      "key": "5_CR24",
      "doi-asserted-by": "publisher",
      "first-page": "793",
      "DOI": "10.1287/mnsc.20.5.783",
      "volume": "20",
      "author": "F. Glover",
      "year": "1974",
      "unstructured": "F. Glover, D. Karney, D. Klingman and A. Napier, \u201cA comparison of computational times for various starting procedures, basis change criteria and solution algorithms for transportation problems\u201d, Management Science 20 (1974) 793\u2013819.",
      "journal-title": "Management Science"
    },
    {
      "key": "5_CR25",
      "doi-asserted-by": "publisher",
      "first-page": "361",
      "DOI": "10.1007/BF01593804",
      "volume": "12",
      "author": "D. Goldfarb",
      "year": "1977",
      "unstructured": "D. Goldfarb and J.K. Reid, \u201cA practicable steepest edge simplex algorithm\u201d, Mathematical Programming 12 (1977) 361\u2013371.",
      "journal-title": "Mathematical Programming"
    },
    {
      "key": "5_CR26",
      "series-title": "Technical Report RC",
      "volume-title": "Steepest edge simplex algorithms for network flow problems",
      "author": "D. Goldfarb",
      "year": "1977",
      "unstructured": "D. Goldfarb, \u201cSteepest edge simplex algorithms for network flow problems\u201d, Technical Report RC 6649, IBM T.J. Watson Research Center (Yorktown Heights, NY, 1977)."
    },
    {
      "key": "5_CR27",
      "unstructured": "D. Goldfarb and M.D. Grigoriadis, \u201cAn efficient steepest-edge algorithm for maximum flow problems\u201d, Tenth International Symposium on Mathematical Programming, Montreal, Canada (1979)."
    },
    {
      "key": "5_CR28",
      "unstructured": "M.D. Grigoriadis, \u201cMinimum cost multistage multicommodity network flows\u201d, NATO Conference on Applications of Optimization Methods for Large-scale Resource Allocation Problems, Elsinore, Denmark (July 1971)."
    },
    {
      "key": "5_CR29",
      "series-title": "Lecture notes, Summer course in Combinatorial Optimization",
      "volume-title": "Algorithms for the minimum cost single and multicommodity network flow problems",
      "author": "M.D. Grigoriadis",
      "year": "1978",
      "unstructured": "M.D. Grigoriadis, \u201cAlgorithms for the minimum cost single and multicommodity network flow problems\u201d, Lecture notes, Summer course in Combinatorial Optimization, SOGESTA, Urbino, Italy (1978)."
    },
    {
      "key": "5_CR30",
      "first-page": "17",
      "volume": "26",
      "author": "M.D. Grigoriadis",
      "year": "1979",
      "unstructured": "M.D. Grigoriadis and T. Hsu, \u201cThe Rutgers minimum cost network flow subroutines\u201d, SIGMAP Bulletin of the ACM 26 (1979) 17\u201318.",
      "journal-title": "SIGMAP Bulletin of the ACM"
    },
    {
      "key": "5_CR31",
      "volume-title": "Fundamentals of computer algorithms",
      "author": "E. Horowitz",
      "year": "1978",
      "unstructured": "E. Horowitz and S.J. Sahni, Fundamentals of computer algorithms (Computer Science Press, Rockville, MD, 1978)."
    },
    {
      "key": "5_CR32",
      "volume-title": "Network flow programming",
      "author": "P.A. Jensen",
      "year": "1980",
      "unstructured": "P.A. Jensen and J.W. Barnes, Network flow programming (Wiley, New York, 1980)."
    },
    {
      "key": "5_CR33",
      "doi-asserted-by": "publisher",
      "first-page": "619",
      "DOI": "10.1287/opre.14.4.619",
      "volume": "14",
      "author": "E.L. Johnson",
      "year": "1966",
      "unstructured": "E.L. Johnson, \u201cNetworks and basic solutions\u201d, Operations Research 14 (1966) 619\u2013623.",
      "journal-title": "Operations Research"
    },
    {
      "key": "5_CR34",
      "volume-title": "Fortran-X: An extended memory version of the DECSYSTEM-20 Fortran Version 7",
      "author": "C.L. Hedrick",
      "year": "1983",
      "unstructured": "C.L. Hedrick, \u201cFortran-X: An extended memory version of the DECSYSTEM-20 Fortran Version 7\u201d, unpublished LCSR Report, Rutgers University (New Brunswick, NJ, November 1983)."
    },
    {
      "key": "5_CR35",
      "doi-asserted-by": "publisher",
      "first-page": "1056",
      "DOI": "10.1287/opre.24.6.1056",
      "volume": "24",
      "author": "D. Karney",
      "year": "1976",
      "unstructured": "D. Karney and D. Klingman, \u201cImplementation and computational study on an in-core out-of-core primal network code\u201d, Operations Research 24 (1976) 1056\u20131077.",
      "journal-title": "Operations Research"
    },
    {
      "key": "5_CR36",
      "volume-title": "Algorithms for network programming",
      "author": "J.L. Kennington",
      "year": "1980",
      "unstructured": "J.L. Kennington and R.V. Helgason, Algorithms for network programming (Wiley, New York, 1980)."
    },
    {
      "key": "5_CR37",
      "doi-asserted-by": "publisher",
      "first-page": "205",
      "DOI": "10.1287/mnsc.14.3.205",
      "volume": "14",
      "author": "M. Klein",
      "year": "1967",
      "unstructured": "M. Klein, \u201cA primal method for minimal cost flows\u201d, Management Science 14 (1967) 205\u2013220.",
      "journal-title": "Management Science"
    },
    {
      "key": "5_CR38",
      "doi-asserted-by": "publisher",
      "first-page": "814",
      "DOI": "10.1287/mnsc.20.5.814",
      "volume": "20",
      "author": "D. Klingman",
      "year": "1974",
      "unstructured": "D. Klingman, A. Napier and J. Stutz, \u201cNETGEN\u2014A program for generating large-scale (un)capacitated assignment, transportation and minimum cost flow network problems\u201d, Management Science 20 (1974) 814\u2013821.",
      "journal-title": "Management Science"
    },
    {
      "key": "5_CR39",
      "volume-title": "The art of computer programming",
      "author": "D.E. Knuth",
      "year": "1973",
      "unstructured": "D.E. Knuth, The art of computer programming\u2014Volume 1 (Addison-Wesley, Reading, MA, 1973)."
    },
    {
      "key": "5_CR40",
      "volume-title": "Combinatorial optimization: Networks and matroids",
      "author": "E.L. Lawler",
      "year": "1976",
      "unstructured": "E.L. Lawler, Combinatorial optimization: Networks and matroids (Holt, Rinehart and Winston, New York, 1976)."
    },
    {
      "key": "5_CR41",
      "doi-asserted-by": "publisher",
      "first-page": "277",
      "DOI": "10.1016/0020-0190(78)90016-9",
      "volume": "7",
      "author": "V. Malhotra",
      "year": "1978",
      "unstructured": "V. Malhotra, M. Kumar and S. Maheshwari, \u201cAn O(|V|3) algorithm for finding maximum flows in networks\u201d, Information Processing Letters 7 (1978) 277\u2013278.",
      "journal-title": "Information Processing Letters"
    },
    {
      "key": "5_CR42",
      "doi-asserted-by": "publisher",
      "first-page": "291",
      "DOI": "10.1007/BF01609034",
      "volume": "15",
      "author": "J. Mulvey",
      "year": "1978",
      "unstructured": "J. Mulvey, \u201cTesting a large-scale network optimization program\u201d, Mathematical Programming 15 (1978) 291\u2013314.",
      "journal-title": "Mathematical Programming"
    },
    {
      "key": "5_CR43",
      "doi-asserted-by": "publisher",
      "first-page": "266",
      "DOI": "10.1145/322063.322070",
      "volume": "25",
      "author": "J. Mulvey",
      "year": "1978",
      "unstructured": "J. Mulvey, \u201cPivot strategies for primal-simplex network codes\u201d, Journal of the ACM 25 (1978) 266\u2013270.",
      "journal-title": "Journal of the ACM"
    },
    {
      "key": "5_CR44",
      "doi-asserted-by": "publisher",
      "first-page": "276",
      "DOI": "10.1287/mnsc.2.3.276",
      "volume": "2",
      "author": "A. Orden",
      "year": "1956",
      "unstructured": "A. Orden, \u201cThe transshipment problem\u201d, Management Science 2 (1956) 276\u2013285.",
      "journal-title": "Management Science"
    },
    {
      "key": "5_CR45",
      "unstructured": "J.B. Orlin, \u201cPolynomial time pivoting procedures for minimum cost network flow problems\u201d, TIMS/ORSA National Meeting, San Francisco, CA, 17 May 1984. Also see \u201cOn the simplex algorithm for networks\u201d, Sloan W.P. 1467\u20131483 (rev. May 1984), M.I.T., Cambridge, MA."
    },
    {
      "key": "5_CR46",
      "first-page": "181",
      "volume-title": "Discrete structures and algorithms",
      "author": "H. Rock",
      "year": "1980",
      "unstructured": "H. Rock, \u201cScaling techniques for minimal cost network flows\u201d, in: U. Page, ed., Discrete structures and algorithms (Carl Hanser, Munchen, 1980) pp. 181\u2013191."
    },
    {
      "key": "5_CR47",
      "doi-asserted-by": "publisher",
      "first-page": "712",
      "DOI": "10.1145/321724.321734",
      "volume": "19",
      "author": "V. Srinivasan",
      "year": "1972",
      "unstructured": "V. Srinivasan and G.L. Thompson, \u201cAccelerated algorithms for labeling and relabeling trees, with applications to distribution problems\u201d, Journal of the ACM 19 (1972) 712\u2013726.",
      "journal-title": "Journal of the ACM"
    },
    {
      "key": "5_CR48",
      "doi-asserted-by": "crossref",
      "unstructured": "E. Tardos, \u201cA strongly polynomial minimum cost circulation algorithm\u201d, Combinatorica (to appear May 1985).",
      "DOI": "10.1007/BF02579369"
    },
    {
      "key": "5_CR49",
      "doi-asserted-by": "publisher",
      "first-page": "255",
      "DOI": "10.1007/BF01580132",
      "volume": "5",
      "author": "N. Zadeh",
      "year": "1973",
      "unstructured": "N. Zadeh, \u201cA bad network problem for the simplex method and other minimum cost flow algorithms\u201d, Mathematical Programming 5 (1973) 255\u2013266.",
      "journal-title": "Mathematical Programming"
    }
  ],
  "container-title": "Mathematical Programming Studies",
  "original-title": [],
  "link": [
    {
      "URL": "http://link.springer.com/content/pdf/10.1007/BFb0121089.pdf",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2020,
        12,
        9
      ]
    ],
    "date-time": "2020-12-09T22:01:21Z",
    "timestamp": 1607551281000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "http://link.springer.com/10.1007/BFb0121089"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1986
      ]
    ]
  },
  "ISBN": [
    "9783642009228",
    "9783642009235"
  ],
  "references-count": 49,
  "URL": "http://dx.doi.org/10.1007/BFb0121089",
  "relation": {},
  "ISSN": [
    "0303-3929"
  ],
  "subject": [],
  "published": {
    "date-parts": [
      [
        1986
      ]
    ]
  }
}