×
Chen, S.; Saigal, Romesh

A primal algorithm for solving a capacitated network flow problem with additional linear constraints. (English) Zbl 0363.90107

Networks 7, 59-79 (1977).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0363.90107

Cited in 18 Documents

MSC:

90C35 Programming involving graphs or networks
90C05 Linear programming
05C35 Extremal problems in graph theory
Cite Review PDF
Full Text: DOI

References:

[1] and , The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974.
[2] and , ”A Starting Procedure for Bounded-Variable Linear Programming Problems and a Modified Minimum Ratio Test,” submitted to Mathematical Programming.
[3] Linear Prograrming and Extensions, Princeton University Press, Princeton, New Jersey, 1963.
[4] Dantzig, J. of Computer and System Sciences 1, 3 pp 213– (1967) · Zbl 0162.23003 · doi:10.1016/S0022-0000(67)80015-1
[5] and , Flows in Networks Princeton University Press, Princeton, New Jersey, 1962.
[6] Glover, Transportation Science 6, 1 pp 171– (1972)
[7] Hartman, Networks 1, 4 pp 333– (1972)
[8] Johnson, Operations Research 14, 4 pp 619– (1966)
[9] ”An Extension of Generalized Upper Bounding Techniques for Linear Programming,” ORC66–24, Operations Research Center, University of California, Berkeley, California, 1966.
[10] and , ”Finding Equivalent Network Formulations for Constrained Network Problems,” Austin Center for Cybenetic Studies, University of Texas, Austin, Texas, July, 1973.
[11] Klingman, Operations Research 23, 1 pp 91– (1975)
[12] The Art of Computer Programming, Volume 2, Seminumerical Algorithms, Addison-Wesley, Reading, Massachusetts, 1969.
[13] The Art of Computer Programming, Volume 3, Sorting and Searching, Addison-Wesley, Reading, Massachusetts, 1973.
[14] Langley, Naval Research Logistics Quarterly 21, 4 pp 637– (1974)
[15] Optimization Theory for Large Systems, MacMillan, New York, 1970.
[16] ”Factorization in Large-Scale Linear Programming,” Working Paper No. 200, Western Management Science Institute, University of California, Los Angeles, 1973.
[17] Advanced Linear Programming Computing Techniques, McGraw-Hill, New York, 1968.
[18] ”Blocking Triangularization of Multistage Linear Programs,” ORC66–9, Operations Research Center, University of California, Berkeley, California, 1966.
[19] ”Multicommodity Flows in Directed Networks,” Ph.D. Thesis, University of California, Berkeley, California, 1968.
[20] Sakarovitch, SIAM J. of Applied Mathematics 15, 4 pp 906– (1967)
[21] Tarjan, SIAM J. on Computing 1, 2 pp 146– (1972)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.