A bad network problem for the simplex method and other minimum cost flow algorithms-Reference-Cited by-同舟云学术

A bad network problem for the simplex method and other minimum cost flow algorithms

Published:1973-12 Issue:1 Volume:5 Page:255-266
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Zadeh Norman

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01580132.pdf

Reference13 articles.

1. R.G. Busacker and P.J. Gowen, “A procedure for determining a family of minimal-cost network flow patterns”, Operations Research Office, The Johns Hopkins University, Baltimore, Md., No. ORO 15 (1961).

2. G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, N.J., 1962).

3. J. Edmonds and R.M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems”,Journal of the Association for Computing Machinery 19 (1972) 248–264.

4. L. Ford and D.R. Fulkerson, “A primal dual algorithm for the capacitated Hitchcock problem”,Naval Research Logistics Quarterly 4 (1957) 47–54.

5. L. Ford and D.R. Fulkerson,flows in networks (Princeton University Press, Princeton, N.J., 1962).

Cited by 94 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Introduction to Transshipments Over Time;Surveys in Combinatorics 2024;2024-06-13

2. Visualizing Multidimensional Linear Programming Problems;Communications in Computer and Information Science;2022

3. Algorithms for flows over time with scheduling costs;Mathematical Programming;2021-11-01

4. Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs;Mathematics of Operations Research;2021-09-14

5. On the Length of Monotone Paths in Polyhedra;SIAM Journal on Discrete Mathematics;2021-01