DOI: 10.1007/bf01586039. On the computational behavior of a polynomial-time network flow algorithm

On the computational behavior of a polynomial-time network flow algorithm

10.1007/bf01586039

Crossref journal-article

Springer Science and Business Media LLC

Mathematical Programming (297)

Bibliography

Bland, R. G., & Jensen, D. L. (1992). On the computational behavior of a polynomial-time network flow algorithm. Mathematical Programming, 54(1â3), 1â39.

Authors 2

Robert G. Bland (first)
David L. Jensen (additional)

References 41 Referenced 21

R.K. Ahuja, A.V. Goldberg, J.B. Orlin and R.E. Tarjan, “Finding minimum cost flows by double scaling,”Mathematical Programming 53 (1992) 243–266. (10.1007/BF01585705) / Mathematical Programming by R.K. Ahuja (1992)
R.K. Ahuja, T.L. Magnanti and J.B. Orlin, “Network flows,” in: G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd, eds.,Optimization, Handbooks in Operations Research and Management Science, vol. 1 (North-Holland, Amsterdam 1989). / Optimization, Handbooks in Operations Research and Management Science, vol. 1 by R.K. Ahuja (1989)
R.K. Ahuja, J.B. Orlin and R.E. Tarjan, “Improved time bounds for the maximum flow problem,”SIAM Journal of Computing 18 (1989) 939–954. (10.1137/0218065) / SIAM Journal of Computing by R.K. Ahuja (1989)
D.P. Bertsekas, “A distributed algorithm for the assignment problem,” unpublished manuscript (1979).
D.P. Bertsekas “A unified framework for primal-dual methods in minimum cost network flow problems,”Mathematical Programming 32 (1985) 125–145. (10.1007/BF01586087) / Mathematical Programming by D.P. Bertsekas (1985)
D.P. Bertsekas “Distributed asynchronous relaxation methods for linear network flow problems,” Technical Report LIDS-P-1986, Laboratory for Decision Systems, MIT (Cambridge, MA, 1986). / “Distributed asynchronous relaxation methods for linear network flow problems,” Technical Report LIDS-P-1986 by D.P. Bertsekas (1986)
D.P. Bertsekas and J. Eckstein, “Dual coordinate step methods for linear network flow problems,”Mathematical Programming 42 (1988) 203–243. (10.1007/BF01589405) / Mathematical Programming by D.P. Bertsekas (1988)
R.G. Bland, “Complementary orthogonal subspaces of ℝ n and orientability of matroids,” dissertation, Cornell University (Ithaca, NY, 1974). / Complementary orthogonal subspaces of ℝ n and orientability of matroids by R.G. Bland (1974)
R.G. Bland and J. Edmonds, “Fast primal algorithms for totally unimodular linear programming,” presented at the XI International Symposium on Mathematical Programming (Bonn, Germany, 1982).
R.G. Bland and D.L. Jensen, “A report on the computational behavior of a polynomial-time network flow algorithm,” Cornell University School of OR/IE Technical Report No. 661 (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–28. (10.1287/mnsc.24.1.1) / Management Science by G.H. Bradley (1977)
N.R. Draper and H. Smith,Applied Regression Analysis (Wiley, New York, 1981, 2nd ed.). / Applied Regression Analysis by N.R. Draper (1981)
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)
L.R. Ford, Jr. and D.R. Fulkerson,Flows in Networks (Princeton University Press, Princeton, NJ 1962). / Flows in Networks by L.R. Ford Jr. (1962)
M.L. Fredman and R.E. Tarjan, “Fibonacci heaps and their uses in improved network optimization algorithms,”Journal of the ACM 34 (1987) 596–615. (10.1145/28869.28874) / Journal of the ACM by M.L. Fredman (1987)
D.R. Fulkerson, “An out-of-kilter algorithm for minimal cost flow problems,”Journal of the SIAM 9 (1961) 18–27. / Journal of the SIAM by D.R. Fulkerson (1961)
D.R. Fulkerson, “Networks, frames, blocking systems,” in: G.B. Dantzig and A.F. Veinott, Jr., eds.,Mathematics of the Decision Sciences, Lectures in Applied Math., vol. 11, (American Mathematical Society, Providence, RI 1968) pp. 303–334. / Mathematics of the Decision Sciences, Lectures in Applied Math., vol. 11 by D.R. Fulkerson (1968)
H.N. Gabow, “Scaling algorithms for network problems,”Journal of Computer and Systems Science 31 (1985) 148–168. (10.1016/0022-0000(85)90039-X) / Journal of Computer and Systems Science by H.N. Gabow (1985)
H.N. Gabow, “On the theoretic and practical efficiency of scaling algorithms for network problems,” presented at the Fall 1984 ORSA/TIMS meeting (Dallas, TX, 1984).
A.V. Goldberg, “A new max-flow algorithm,” Technical Report MIT/LCS/TM-291, Laboratory for Computer Science, MIT (Cambridge, MA, 1985). / “A new max-flow algorithm,” Technical Report MIT/LCS/TM-291 by A.V. Goldberg (1985)
A.V. Goldberg, “Efficient graph algorithms for sequential and parallel computers”, Dissertation, MIT (Cambridge, MA., 1987). / Efficient graph algorithms for sequential and parallel computers by A.V. Goldberg (1987)
A.V. Goldberg, E. Tardos and R.E. Tarjan, “Network flow algorithms,” in: B. Korte, L. Lovász, H.J. Prömel and A. Schrÿver, eds.,Flows, Paths, and VLSI Layout (Springer, Berlin, 1990) pp 101–164. / Flows, Paths, and VLSI Layout by A.V. Goldberg (1990)
A.V. Goldberg and R.E. Tarjan, “A new approach to the maximum flow problem,”Proceedings of the 18th ACM Symposium on Theory of Computing (1986) 136–146. (10.1145/12130.12144)
A.V. Goldberg and R.E. Tarjan, “A new approach to the maximum flow problem,”Journal of the ACM 35 (1988) 921–940. (10.1145/48014.61051) / Journal of the ACM by A.V. Goldberg (1988)
A.V. Goldberg and R.E. Tarjan, “Finding minimum cost circulations by successive approximations,”Mathematics of OR 15 (1990) 430–466. (10.1287/moor.15.3.430) / Mathematics of OR by A.V. Goldberg (1990)
M.D. Grigoriadis, “An efficient implementation of the network simplex method,”Mathematical Programming Study 26 (1986) 83–111. (10.1007/BFb0121089) / Mathematical Programming Study by M.D. Grigoriadis (1986)
M.D. Grigoriadis, private communication.
M.D. Grigoriadis and T. Hsu, “RNET — The Rutgers minimum-cost network flow subroutines — user documentation,” Computer Science Technical Report, Rutgers University (New Brunswick, NY, 1979). / RNET — The Rutgers minimum-cost network flow subroutines — user documentation,” Computer Science Technical Report by M.D. Grigoriadis (1979)
D.L. Jensen, “Coloring and duality: combinatorial augmentation methods,” Dissertation, Cornell University (Ithaca, NY, 1985). / Coloring and duality: combinatorial augmentation methods by D.L. Jensen (1985)
D. Klingman, A. Napier and J. Stutz, “NETGEN: a program for generating large-scale assignment, transportation and minimum cost network flow problems,”Management Science 20 (1974) 814–821. (10.1287/mnsc.20.5.814) / Management Science by D. Klingman (1974)
L.G. Khachiyan, “A polynomial algorithm in linear programming,”Doklady Akademiia Nauk SSSR 224 (1979) 1093–1096 (in Russian). [English translation in:Soviet Mathematics Doklady 20 (1979) 191–194.] / Doklady Akademiia Nauk SSSR by L.G. Khachiyan (1979)
V.M. Malhotra, M. Pramodh Kumar and S.N. 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.M. Malhotra (1978)
G.J. Minty, “Monotone networks,”Proceedings of the Royal Society, London, Series A 257 (1960) 194–212. / Proceedings of the Royal Society, London, Series A by G.J. Minty (1960)
J.B. Orlin, “A faster polynomial minimum cost flow algorithm,”Proceedings of the 20th ACM Symposium on Theory of Computing (1988) 377–387. (10.21236/ADA457044)
H. Röck, “Scaling techniques for minimal cost network flows,” in: V. Page, ed.,Discrete structures and algorithms (Carl Hansen, Munich, 1980). / Discrete structures and algorithms by H. Röck (1980)
P.D. Seymour, “Decomposition of regular matroids,”Journal of Combinatorial Theory, Series B 28 (1980) 305–359. (10.1016/0095-8956(80)90075-1) / Journal of Combinatorial Theory, Series B by P.D. Seymour (1980)
D.D. Sleator, “An O(nm logn) algorithm for maximum network flow,” Dissertation, Technical Report STAN-CS-80-831, Stanford University (Stanford, CA, 1980). / An O(nm logn) algorithm for maximum network flow by D.D. Sleator (1980)
D.D. Sleator and R.E. Tarjan, “A data structure for dynamic trees,”Journal of Computer and System Sciences 26 (1983) 362–391. (10.1016/0022-0000(83)90006-5) / Journal of Computer and System Sciences by D.D. Sleator (1983)
É. Tardos, “A strongly polynomial minimum cost circulation algorithm,”Combinatorica 5 (1985) 247–255. (10.1007/BF02579369) / Combinatorica by É. Tardos (1985)
É. Tardos, “A strongly polynomial algorithm for solving combinatorial linear programs,”Operations Research 34 (1986) 250–256. (10.1287/opre.34.2.250) / Operations Research by É. Tardos (1986)
R.E. Tarjan,Data Structures and Network Algorithms (SIAM, Philadelphia, PA, 1983). (10.1137/1.9781611970265) / Data Structures and Network Algorithms by R.E. Tarjan (1983)

Dates

Type	When
Created	20 years, 4 months ago (April 28, 2005, 12:35 a.m.)
Deposited	6 years, 3 months ago (May 3, 2019, 7:32 a.m.)
Indexed	1 year, 10 months ago (Oct. 30, 2023, 8:59 p.m.)
Issued	33 years, 7 months ago (Feb. 1, 1992)
Published	33 years, 7 months ago (Feb. 1, 1992)
Published Print	33 years, 7 months ago (Feb. 1, 1992)

Funders 0

None

BibTeX

@article{Bland_1992, title={On the computational behavior of a polynomial-time network flow algorithm}, volume={54}, ISSN={1436-4646}, url={http://dx.doi.org/10.1007/bf01586039}, DOI={10.1007/bf01586039}, number={1–3}, journal={Mathematical Programming}, publisher={Springer Science and Business Media LLC}, author={Bland, Robert G. and Jensen, David L.}, year={1992}, month=feb, pages={1–39} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2023,
        10,
        31
      ]
    ],
    "date-time": "2023-10-31T00:59:58Z",
    "timestamp": 1698713998505
  },
  "reference-count": 41,
  "publisher": "Springer Science and Business Media LLC",
  "issue": "1-3",
  "license": [
    {
      "start": {
        "date-parts": [
          [
            1992,
            2,
            1
          ]
        ],
        "date-time": "1992-02-01T00:00:00Z",
        "timestamp": 696902400000
      },
      "content-version": "tdm",
      "delay-in-days": 0,
      "URL": "http://www.springer.com/tdm"
    }
  ],
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        1992,
        2
      ]
    ]
  },
  "DOI": "10.1007/bf01586039",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2005,
        4,
        28
      ]
    ],
    "date-time": "2005-04-28T04:35:49Z",
    "timestamp": 1114662949000
  },
  "page": "1-39",
  "source": "Crossref",
  "is-referenced-by-count": 21,
  "title": "On the computational behavior of a polynomial-time network flow algorithm",
  "prefix": "10.1007",
  "volume": "54",
  "author": [
    {
      "given": "Robert G.",
      "family": "Bland",
      "sequence": "first",
      "affiliation": []
    },
    {
      "given": "David L.",
      "family": "Jensen",
      "sequence": "additional",
      "affiliation": []
    }
  ],
  "member": "297",
  "reference": [
    {
      "key": "CR1",
      "doi-asserted-by": "crossref",
      "first-page": "243",
      "DOI": "10.1007/BF01585705",
      "volume": "53",
      "author": "R.K. Ahuja",
      "year": "1992",
      "unstructured": "R.K. Ahuja, A.V. Goldberg, J.B. Orlin and R.E. Tarjan, \u201cFinding minimum cost flows by double scaling,\u201dMathematical Programming 53 (1992) 243\u2013266.",
      "journal-title": "Mathematical Programming"
    },
    {
      "key": "CR2",
      "volume-title": "Optimization, Handbooks in Operations Research and Management Science, vol. 1",
      "author": "R.K. Ahuja",
      "year": "1989",
      "unstructured": "R.K. Ahuja, T.L. Magnanti and J.B. Orlin, \u201cNetwork flows,\u201d in: G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd, eds.,Optimization, Handbooks in Operations Research and Management Science, vol. 1 (North-Holland, Amsterdam 1989)."
    },
    {
      "key": "CR3",
      "doi-asserted-by": "crossref",
      "first-page": "939",
      "DOI": "10.1137/0218065",
      "volume": "18",
      "author": "R.K. Ahuja",
      "year": "1989",
      "unstructured": "R.K. Ahuja, J.B. Orlin and R.E. Tarjan, \u201cImproved time bounds for the maximum flow problem,\u201dSIAM Journal of Computing 18 (1989) 939\u2013954.",
      "journal-title": "SIAM Journal of Computing"
    },
    {
      "key": "CR4",
      "unstructured": "D.P. Bertsekas, \u201cA distributed algorithm for the assignment problem,\u201d unpublished manuscript (1979)."
    },
    {
      "key": "CR5",
      "doi-asserted-by": "crossref",
      "first-page": "125",
      "DOI": "10.1007/BF01586087",
      "volume": "32",
      "author": "D.P. Bertsekas",
      "year": "1985",
      "unstructured": "D.P. Bertsekas \u201cA unified framework for primal-dual methods in minimum cost network flow problems,\u201dMathematical Programming 32 (1985) 125\u2013145.",
      "journal-title": "Mathematical Programming"
    },
    {
      "key": "CR6",
      "volume-title": "\u201cDistributed asynchronous relaxation methods for linear network flow problems,\u201d Technical Report LIDS-P-1986",
      "author": "D.P. Bertsekas",
      "year": "1986",
      "unstructured": "D.P. Bertsekas \u201cDistributed asynchronous relaxation methods for linear network flow problems,\u201d Technical Report LIDS-P-1986, Laboratory for Decision Systems, MIT (Cambridge, MA, 1986)."
    },
    {
      "key": "CR7",
      "doi-asserted-by": "crossref",
      "first-page": "203",
      "DOI": "10.1007/BF01589405",
      "volume": "42",
      "author": "D.P. Bertsekas",
      "year": "1988",
      "unstructured": "D.P. Bertsekas and J. Eckstein, \u201cDual coordinate step methods for linear network flow problems,\u201dMathematical Programming 42 (1988) 203\u2013243.",
      "journal-title": "Mathematical Programming"
    },
    {
      "key": "CR8",
      "volume-title": "Complementary orthogonal subspaces of \u211d n and orientability of matroids",
      "author": "R.G. Bland",
      "year": "1974",
      "unstructured": "R.G. Bland, \u201cComplementary orthogonal subspaces of \u211d n and orientability of matroids,\u201d dissertation, Cornell University (Ithaca, NY, 1974)."
    },
    {
      "key": "CR9",
      "unstructured": "R.G. Bland and J. Edmonds, \u201cFast primal algorithms for totally unimodular linear programming,\u201d presented at the XI International Symposium on Mathematical Programming (Bonn, Germany, 1982)."
    },
    {
      "key": "CR10",
      "unstructured": "R.G. Bland and D.L. Jensen, \u201cA report on the computational behavior of a polynomial-time network flow algorithm,\u201d Cornell University School of OR/IE Technical Report No. 661 (Ithaca, NY, 1985)."
    },
    {
      "key": "CR11",
      "doi-asserted-by": "crossref",
      "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,\u201dManagement Science 24 (1977) 1\u201328.",
      "journal-title": "Management Science"
    },
    {
      "key": "CR12",
      "volume-title": "Applied Regression Analysis",
      "author": "N.R. Draper",
      "year": "1981",
      "unstructured": "N.R. Draper and H. Smith,Applied Regression Analysis (Wiley, New York, 1981, 2nd ed.).",
      "edition": "2nd ed."
    },
    {
      "key": "CR13",
      "doi-asserted-by": "crossref",
      "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,\u201dJournal of the ACM 19 (1972) 248\u2013264.",
      "journal-title": "Journal of the ACM"
    },
    {
      "key": "CR14",
      "volume-title": "Flows in Networks",
      "author": "L.R. Ford Jr.",
      "year": "1962",
      "unstructured": "L.R. Ford, Jr. and D.R. Fulkerson,Flows in Networks (Princeton University Press, Princeton, NJ 1962)."
    },
    {
      "key": "CR15",
      "doi-asserted-by": "crossref",
      "first-page": "596",
      "DOI": "10.1145/28869.28874",
      "volume": "34",
      "author": "M.L. Fredman",
      "year": "1987",
      "unstructured": "M.L. Fredman and R.E. Tarjan, \u201cFibonacci heaps and their uses in improved network optimization algorithms,\u201dJournal of the ACM 34 (1987) 596\u2013615.",
      "journal-title": "Journal of the ACM"
    },
    {
      "key": "CR16",
      "first-page": "18",
      "volume": "9",
      "author": "D.R. Fulkerson",
      "year": "1961",
      "unstructured": "D.R. Fulkerson, \u201cAn out-of-kilter algorithm for minimal cost flow problems,\u201dJournal of the SIAM 9 (1961) 18\u201327.",
      "journal-title": "Journal of the SIAM"
    },
    {
      "key": "CR17",
      "first-page": "303",
      "volume-title": "Mathematics of the Decision Sciences, Lectures in Applied Math., vol. 11",
      "author": "D.R. Fulkerson",
      "year": "1968",
      "unstructured": "D.R. Fulkerson, \u201cNetworks, frames, blocking systems,\u201d in: G.B. Dantzig and A.F. Veinott, Jr., eds.,Mathematics of the Decision Sciences, Lectures in Applied Math., vol. 11, (American Mathematical Society, Providence, RI 1968) pp. 303\u2013334."
    },
    {
      "key": "CR18",
      "doi-asserted-by": "crossref",
      "first-page": "148",
      "DOI": "10.1016/0022-0000(85)90039-X",
      "volume": "31",
      "author": "H.N. Gabow",
      "year": "1985",
      "unstructured": "H.N. Gabow, \u201cScaling algorithms for network problems,\u201dJournal of Computer and Systems Science 31 (1985) 148\u2013168.",
      "journal-title": "Journal of Computer and Systems Science"
    },
    {
      "key": "CR19",
      "unstructured": "H.N. Gabow, \u201cOn the theoretic and practical efficiency of scaling algorithms for network problems,\u201d presented at the Fall 1984 ORSA/TIMS meeting (Dallas, TX, 1984)."
    },
    {
      "key": "CR20",
      "volume-title": "\u201cA new max-flow algorithm,\u201d Technical Report MIT/LCS/TM-291",
      "author": "A.V. Goldberg",
      "year": "1985",
      "unstructured": "A.V. Goldberg, \u201cA new max-flow algorithm,\u201d Technical Report MIT/LCS/TM-291, Laboratory for Computer Science, MIT (Cambridge, MA, 1985)."
    },
    {
      "key": "CR21",
      "volume-title": "Efficient graph algorithms for sequential and parallel computers",
      "author": "A.V. Goldberg",
      "year": "1987",
      "unstructured": "A.V. Goldberg, \u201cEfficient graph algorithms for sequential and parallel computers\u201d, Dissertation, MIT (Cambridge, MA., 1987)."
    },
    {
      "key": "CR22",
      "first-page": "101",
      "volume-title": "Flows, Paths, and VLSI Layout",
      "author": "A.V. Goldberg",
      "year": "1990",
      "unstructured": "A.V. Goldberg, E. Tardos and R.E. Tarjan, \u201cNetwork flow algorithms,\u201d in: B. Korte, L. Lov\u00e1sz, H.J. Pr\u00f6mel and A. Schr\u00ffver, eds.,Flows, Paths, and VLSI Layout (Springer, Berlin, 1990) pp 101\u2013164."
    },
    {
      "key": "CR23",
      "doi-asserted-by": "crossref",
      "unstructured": "A.V. Goldberg and R.E. Tarjan, \u201cA new approach to the maximum flow problem,\u201dProceedings of the 18th ACM Symposium on Theory of Computing (1986) 136\u2013146.",
      "DOI": "10.1145/12130.12144"
    },
    {
      "key": "CR24",
      "doi-asserted-by": "crossref",
      "first-page": "921",
      "DOI": "10.1145/48014.61051",
      "volume": "35",
      "author": "A.V. Goldberg",
      "year": "1988",
      "unstructured": "A.V. Goldberg and R.E. Tarjan, \u201cA new approach to the maximum flow problem,\u201dJournal of the ACM 35 (1988) 921\u2013940.",
      "journal-title": "Journal of the ACM"
    },
    {
      "key": "CR25",
      "doi-asserted-by": "crossref",
      "first-page": "430",
      "DOI": "10.1287/moor.15.3.430",
      "volume": "15",
      "author": "A.V. Goldberg",
      "year": "1990",
      "unstructured": "A.V. Goldberg and R.E. Tarjan, \u201cFinding minimum cost circulations by successive approximations,\u201dMathematics of OR 15 (1990) 430\u2013466.",
      "journal-title": "Mathematics of OR"
    },
    {
      "key": "CR26",
      "doi-asserted-by": "crossref",
      "first-page": "83",
      "DOI": "10.1007/BFb0121089",
      "volume": "26",
      "author": "M.D. Grigoriadis",
      "year": "1986",
      "unstructured": "M.D. Grigoriadis, \u201cAn efficient implementation of the network simplex method,\u201dMathematical Programming Study 26 (1986) 83\u2013111.",
      "journal-title": "Mathematical Programming Study"
    },
    {
      "key": "CR27",
      "unstructured": "M.D. Grigoriadis, private communication."
    },
    {
      "key": "CR28",
      "volume-title": "RNET \u2014 The Rutgers minimum-cost network flow subroutines \u2014 user documentation,\u201d Computer Science Technical Report",
      "author": "M.D. Grigoriadis",
      "year": "1979",
      "unstructured": "M.D. Grigoriadis and T. Hsu, \u201cRNET \u2014 The Rutgers minimum-cost network flow subroutines \u2014 user documentation,\u201d Computer Science Technical Report, Rutgers University (New Brunswick, NY, 1979)."
    },
    {
      "key": "CR29",
      "volume-title": "Coloring and duality: combinatorial augmentation methods",
      "author": "D.L. Jensen",
      "year": "1985",
      "unstructured": "D.L. Jensen, \u201cColoring and duality: combinatorial augmentation methods,\u201d Dissertation, Cornell University (Ithaca, NY, 1985)."
    },
    {
      "key": "CR30",
      "doi-asserted-by": "crossref",
      "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: a program for generating large-scale assignment, transportation and minimum cost network flow problems,\u201dManagement Science 20 (1974) 814\u2013821.",
      "journal-title": "Management Science"
    },
    {
      "key": "CR31",
      "first-page": "1093",
      "volume": "224",
      "author": "L.G. Khachiyan",
      "year": "1979",
      "unstructured": "L.G. Khachiyan, \u201cA polynomial algorithm in linear programming,\u201dDoklady Akademiia Nauk SSSR 224 (1979) 1093\u20131096 (in Russian). [English translation in:Soviet Mathematics Doklady 20 (1979) 191\u2013194.]",
      "journal-title": "Doklady Akademiia Nauk SSSR"
    },
    {
      "key": "CR32",
      "doi-asserted-by": "crossref",
      "first-page": "277",
      "DOI": "10.1016/0020-0190(78)90016-9",
      "volume": "7",
      "author": "V.M. Malhotra",
      "year": "1978",
      "unstructured": "V.M. Malhotra, M. Pramodh Kumar and S.N. Maheshwari, \u201cAn O(|V 3|) algorithm for finding maximum flows in networks,\u201dInformation Processing Letters 7 (1978) 277\u2013278.",
      "journal-title": "Information Processing Letters"
    },
    {
      "key": "CR33",
      "first-page": "194",
      "volume": "257",
      "author": "G.J. Minty",
      "year": "1960",
      "unstructured": "G.J. Minty, \u201cMonotone networks,\u201dProceedings of the Royal Society, London, Series A 257 (1960) 194\u2013212.",
      "journal-title": "Proceedings of the Royal Society, London, Series A"
    },
    {
      "key": "CR34",
      "doi-asserted-by": "crossref",
      "unstructured": "J.B. Orlin, \u201cA faster polynomial minimum cost flow algorithm,\u201dProceedings of the 20th ACM Symposium on Theory of Computing (1988) 377\u2013387.",
      "DOI": "10.21236/ADA457044"
    },
    {
      "key": "CR35",
      "volume-title": "Discrete structures and algorithms",
      "author": "H. R\u00f6ck",
      "year": "1980",
      "unstructured": "H. R\u00f6ck, \u201cScaling techniques for minimal cost network flows,\u201d in: V. Page, ed.,Discrete structures and algorithms (Carl Hansen, Munich, 1980)."
    },
    {
      "key": "CR36",
      "doi-asserted-by": "crossref",
      "first-page": "305",
      "DOI": "10.1016/0095-8956(80)90075-1",
      "volume": "28",
      "author": "P.D. Seymour",
      "year": "1980",
      "unstructured": "P.D. Seymour, \u201cDecomposition of regular matroids,\u201dJournal of Combinatorial Theory, Series B 28 (1980) 305\u2013359.",
      "journal-title": "Journal of Combinatorial Theory, Series B"
    },
    {
      "key": "CR37",
      "volume-title": "An O(nm logn) algorithm for maximum network flow",
      "author": "D.D. Sleator",
      "year": "1980",
      "unstructured": "D.D. Sleator, \u201cAn O(nm logn) algorithm for maximum network flow,\u201d Dissertation, Technical Report STAN-CS-80-831, Stanford University (Stanford, CA, 1980)."
    },
    {
      "key": "CR38",
      "doi-asserted-by": "crossref",
      "first-page": "362",
      "DOI": "10.1016/0022-0000(83)90006-5",
      "volume": "26",
      "author": "D.D. Sleator",
      "year": "1983",
      "unstructured": "D.D. Sleator and R.E. Tarjan, \u201cA data structure for dynamic trees,\u201dJournal of Computer and System Sciences 26 (1983) 362\u2013391.",
      "journal-title": "Journal of Computer and System Sciences"
    },
    {
      "key": "CR39",
      "doi-asserted-by": "crossref",
      "first-page": "247",
      "DOI": "10.1007/BF02579369",
      "volume": "5",
      "author": "\u00c9. Tardos",
      "year": "1985",
      "unstructured": "\u00c9. Tardos, \u201cA strongly polynomial minimum cost circulation algorithm,\u201dCombinatorica 5 (1985) 247\u2013255.",
      "journal-title": "Combinatorica"
    },
    {
      "key": "CR40",
      "doi-asserted-by": "crossref",
      "first-page": "250",
      "DOI": "10.1287/opre.34.2.250",
      "volume": "34",
      "author": "\u00c9. Tardos",
      "year": "1986",
      "unstructured": "\u00c9. Tardos, \u201cA strongly polynomial algorithm for solving combinatorial linear programs,\u201dOperations Research 34 (1986) 250\u2013256.",
      "journal-title": "Operations Research"
    },
    {
      "key": "CR41",
      "doi-asserted-by": "crossref",
      "DOI": "10.1137/1.9781611970265",
      "volume-title": "Data Structures and Network Algorithms",
      "author": "R.E. Tarjan",
      "year": "1983",
      "unstructured": "R.E. Tarjan,Data Structures and Network Algorithms (SIAM, Philadelphia, PA, 1983)."
    }
  ],
  "container-title": "Mathematical Programming",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "http://link.springer.com/content/pdf/10.1007/BF01586039.pdf",
      "content-type": "application/pdf",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "http://link.springer.com/article/10.1007/BF01586039/fulltext.html",
      "content-type": "text/html",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "http://link.springer.com/content/pdf/10.1007/BF01586039",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2019,
        5,
        3
      ]
    ],
    "date-time": "2019-05-03T11:32:35Z",
    "timestamp": 1556883155000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "http://link.springer.com/10.1007/BF01586039"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1992,
        2
      ]
    ]
  },
  "references-count": 41,
  "journal-issue": {
    "issue": "1-3",
    "published-print": {
      "date-parts": [
        [
          1992,
          2
        ]
      ]
    }
  },
  "alternative-id": [
    "BF01586039"
  ],
  "URL": "http://dx.doi.org/10.1007/BF01586039",
  "relation": {},
  "ISSN": [
    "0025-5610",
    "1436-4646"
  ],
  "subject": [],
  "container-title-short": "Mathematical Programming",
  "published": {
    "date-parts": [
      [
        1992,
        2
      ]
    ]
  }
}