A dual exterior point simplex type algorithm for the minimum cost network flow problem

Yugoslav Journal of Operations Research

Volumn 19, Issue 1, 2009, Pages 157-170

  Geranis, George ^a   Paparizzos, Konstantinos ^a   Sifaleras, Angelo ^a  

^a UNIVERSITY OF MACEDONIA   (Greece)

Author keywords

Combinatorial optimization; Minimum cost network flow problem; Operations research

Indexed keywords

EID: 84859842550     PISSN: 03540243     EISSN: 23346043     Source Type: Journal    
DOI: 10.2298/YJOR0901157G     Document Type: Article

References (16)

1. Ahuja, R., Magnanti, T., Orlin, J., and Reddy, M., "Applications of network optimization", Handbooks of Operations Research and Management Science, (1995) 1-83.
2. Ahuja, R., and Orlin, J., "Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems", Massachusetts Institute of Technology, Operations Research Center, Massachusetts Institute of Technology, Operations Research Center, Working Paper OR 189-88, (1988).
3. 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 (4) (1978) 315-339.
4. Bertsekas, D. P., and Tseng, P., "RELAX-IV: A Faster version of the RELAX code for solving minimum cost flow problems", Technical Report, Massachusetts Institute of Technology, Laboratory for Information and Decision Systems, 1994.
5. Eppstein, D., "Clustering for faster network simplex pivots", Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, 1994.
6. Fredman, M., and Tarjan, R., "Fibonacci heaps and their uses in improved network optimization algorithms", Journal of the ACM, 34 (3) (1987) 596-615.
7. Glover, F., Karney, D., and Klingman, D., "Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems", Networks, 4 (3) (1974) 191-212.
8. Glover, F., Klingman, D., and Napier, A., "Basic dual feasible solutions for a class of generalized networks", Operations Research, 20 (1) (1972) 126-136.
9. Glover, F., Klingman, D., and Phillips, N., Network Models in Optimization and Their Applications in Practice, Wiley Publications, 1992.
10. Goldberg, A., Grigoriadis, M., and Tarjan, R., "Use of dynamic trees in a network simplex algorithm for the maximum flow problem", Mathematical Programming, 50 (3) (1991) 277-290.
11. Hultz, J., and Klingman, D., "An advanced dual basic feasible solution for a class of capacitated generalized networks", Operations Research, 24 (2) (1976).
12. 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, Taylor & Francis Publications, 37 (7) (2006) 765-782.
13. Karagiannis, P., Paparrizos, K., Samaras, N., and Sifaleras, A., "A new simplex type algorithm for the minimum cost network flow problem", Proceedings of the 7th Balkan Conference on Operational Research, 2005, 133-139.
14. Kennington, J.L., and Helgason, R.V., Algorithms for Network Programming, Wiley Publications, 1980.
15. Orlin, J., "Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem", Sloan School of Management, M.I.T., Cambridge, MA, Technical Report No. 1615-84, 1984.
16. Tarjan, R. E., "Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm", Mathematical Programming, 78(2) (1997) 169-177.