An exterior simplex type algorithm for the Minimum Cost Network Flow Problem

Computers and Operations Research

Volumn 36, Issue 4, 2009, Pages 1176-1190

  Paparrizos, Konstantinos ^a   Samaras, Nikolaos ^a   Sifaleras, Angelo ^a  

^a UNIVERSITY OF MACEDONIA   (Greece)

Author keywords

Combinatorial optimization; Exterior point algorithm; Minimum Cost Network Flow Problem; Simplex algorithm

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMBINATORIAL OPTIMIZATION; NETWORK PROTOCOLS; SENSOR NETWORKS;

EMPIRICAL STUDIES; EXTERIOR POINT ALGORITHM; MINIMUM COST NETWORK FLOW PROBLEM; MINIMUM COST NETWORK FLOW PROBLEMS; NETWORK PROBLEMS; PROOF OF CORRECTNESSES; SIMPLEX ALGORITHM; SIMPLEX ALGORITHMS; TYPE CATEGORIES;

COMBINATORIAL MATHEMATICS;

EID: 54449089577     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.01.001     Document Type: Article

References (28)

1. Ahuja R.K., Magnanti T.L., Orlin J.B., and Reddy M.R. Applications of network optimization. In: Ball M.O., Magnanti T.L., Monma C.L., and Nemhauser G.L. (Eds). Handbooks of operations research and management science, 7: network models (1995), Elsevier Publications, Amsterdam 1-83
2. Glover F., Klingman D., and Phillips N. Network models in optimization and their applications in practice. 1st ed. (1992), Wiley, New York
3. Edmonds J., and Karp R.M. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of ACM 19 (1972) 248-264
4. Tardos E. A strongly polynomial minimum cost circulation algorithm. Combinatorica 5 (1985) 247-255
5. Ahuja R.K., Goldberg A.V., Orlin J.B., and Tarjan R.E. Finding minimum-cost flows by double scaling. Mathematical Programming 53 (1992) 243-266
6. Orlin J.B. A faster strongly polynomial minimum cost flow algorithm. Operation Research 41 (1993) 338-350
7. Goldberg AV, Tarjan R. Solving minimum-cost flow problems by successive approximation. In: Proceedings of the 19th annual ACM conference on theory of computing, 1987. p. 7-18.
8. Orlin J.B. A polynomial time primal network simplex algorithm for minimum cost flows. Mathematical Programming 78 (1997) 109-129
9. Resende M.G.C., and Pardalos P.M. Interior point algorithms for network flow problems. In: Beasley J. (Ed). Advances in linear and integer programming (1996) 147-187
10. Paparrizos K., Samaras N., and Tsiplidis K. Pivoting algorithms for (LP) generating two paths. In: Pardalos P., and Floudas C. (Eds). Encyclopedia of optimization vol. 4 (2001), Kluwer Academic Publishers, Dordrecht 302-306
11. Paparrizos K. An infeasible (exterior point) simplex algorithm for assignment problems. Mathematical Programming 51 (1991) 45-54
12. Sherali H.D., Ozdaryal B., Adams W.P., and Attia N. On using exterior penalty approaches for solving linear programming problems. Computers & Operations Research 28 11 (2001) 1049-1074
13. Bazaraa M.S., Jarvis J.J., and Sherali H.D. Linear programming and network flows. 3rd ed. (2005), Wiley, Hoboken, NJ
14. Bland R.G. New finite pivoting rules for the simplex method. Mathematics of Operations Research 2 (1977) 103-107
15. Paparrizos K, Samaras N, Sifaleras A. Some preliminary results on the cycling problem for the network exterior point simplex algorithm. In: Proceedings of the seventh international conference on operations and quantitative management, Jaipur, India, 2006. p. 536-40.
16. Glover F., Karney D., and Klingman D. The augmented predecessor index method for locating stepping stone paths and assigning dual prices in distribution problems. Transportation Science 6 (1972) 171-180
17. Murphy C.M., and Hung M.S. Network generation using the Prufer code. Computers & Operations Research 13 6 (1986) 693-705
18. Lee Y, Orlin JB. Computational testing of a network simplex algorithm. In: Proceedings of the first DIMACS international algorithm implementation challenge, 1991.
19. Goldberg A.V., Grigoriadis M.D., and Tarjan R.E. Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Mathematical Programming 50 (1991) 277-290
20. Fredman M.C., and Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of ACM 34 3 (1987) 596-615
21. Ali A.I., Helgason R.V., Kennington J.L., and Lall H.S. Primal simplex network codes: state-of-the-art implementation technology. Networks 8 (1978) 315-339
22. Bertsekas DP, Tseng P. RELAX-IV: a faster version of the RELAX code for solving minimum cost flow problems. Technical Report, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 1994.
23. Curet N.D. Applying steepest-edge techniques to a network primal-dual algorithm. Computers & Operations Research 24 7 (1997) 601-609
24. Grigoriadis M. An efficient implementation of the network simplex method. Mathematical Programming Study 26 (1984) 83-111
25. Zadeh N. More pathological examples for network flow problems. Mathematical Programming 5 (1973) 217-224
26. Zadeh N. A bad network problem for the simplex method and other minimum cost flow algorithms. Mathematical Programming 5 (1973) 255-266
27. Cunningham W.H. A network simplex method. Mathematical Programming 11 (1976) 105-116
28. Karagiannis P., Markelis I., Paparrizos K., Samaras N., and Sifaleras A. E-learning technologies: employing Matlab web server to facilitate the education of mathematical programming. International Journal of Mathematical Education in Science and Technology 37 7 (2006) 765-782