A non improving simplex algorithm for transportation problems

RAIRO Recherche Operationnelle

Volumn 30, Issue 1, 1996, Pages 1-15

  Paparrizos, Konstantinos ^a  

^a UNIVERSITY OF MACEDONIA   (Greece)

Author keywords

Exterior point algorithms; Forest algorithms; Pivoting; Simplex method; Strong bases; Transportation problem

Indexed keywords

ALGORITHMS; GRAPH THEORY;

ALGORITHM ANALYSIS; FOREST(GRAPH); PIVOTING METHOD; SIMPLEX METHOD; STRONG BASE; TRANSPORTATION PROBLEM;

TRANSPORTATION;

EID: 0030356631     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro/1996300100011     Document Type: Article

References (14)

1. H. ACHATZ, P. KLEINSCHMIDT and K. PAPARRIZOS, A Dual Forest Algorithm for the Assignment Problem, DIMACS, 1989, 4, pp. 1-10.
2. M. AKGUL, A Genuinly polynomial Primal Simplex Algorithm for the Assignment Problem, SERC Report, IEOR 87-07, 1987, Bilkent University.
3. K. ANSTRIECHER and T. TERLAKY, A Monotonic Build-Up Simplex Algorithm for Linear Programming, Operations Research, 1994, 42, pp. 556-561.
4. M. L. BALINSKI, Signature Methods for the Assignment Problem, Operations Research, 1985, 33, pp. 527-537.
5. M. L. BALINSKI, A Competitive (Dual) Simplex Method for the Assignment Problem, Mathematical Programming, 1986, 34, pp. 125-141.
6. W. H. CUNNINGHAM, A Network Simplex Algorithm., Mathematical Programming, 1976, 11, pp. 105-116.
7. M. S. HUNG and W, O. ROM, Solving the Assignment Problem by Relaxation, Operations Research, 1980, 28, pp. 969-982.
8. D. GOLDFARB, Efficient Dual Simplex Algorithms for the Assignment Problem, Mathematical Programming, 1985, 33, pp. 969-982.
9. P. KLEINSCHMIDT, C. W. LEE and H. SCANNATH, Transportation Problems Which can be Solved by the Use of Hirsch-paths for the Dual Problems, Mathematical Programming, 1987, 37, pp. 153-168.
10. K. PAPARRIZOS, An Infeasible (Exterior Point) Simplex Algorithm for Assignment Problems, Mathematical Programming, 1988, 51, pp. 45-54.
11. K. PAPARRIZOS, A Network Exterior Point Algorithm, Presented at the EURO X Conference on Operational Research, Beograd, Yug, 1989.
12. K. PAPARRIZOS, An Exterior Point Simplex Algorithm for General Linear Problems, Annals of Operations Research, 1993, 32, pp. 497-508.
13. T. TERLAKY, A Convergent Criss-Cross Method, Math. Oper. und Stat. ser. Optimization, 1985, 16, pp. 683-690.
14. S. ZIONTS, The Criss-Cross Method for Solving Linear Programming Problems, Management Science, 1969, 15, pp. 426-445.