Fortran subroutines for network flow optimization using an interior point algorithm

Pesquisa Operacional

Volumn 28, Issue 2, 2008, Pages 243-261

  Portugal, L F ^a   Resende, M G C ^b   Veiga, G ^c   Patricio J ^d,e   Judice J J ^a,e  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b AT AND T LABS RESEARCH   (United States)

^c HTF Software   (Brazil)

^d INSTITUTO POLITÉCNICO DE TOMAR   (Portugal)

^e INSTITUTO DE TELECOMUNICAÇÕES   (Portugal)

Author keywords

Conjugate gradient method; FORTRAN subroutines; Interior point method; Network flow problems; Optimization

Indexed keywords

EID: 54949142189     PISSN: 01017438     EISSN: 16785142     Source Type: Journal    
DOI: 10.1590/S0101-74382008000200005     Document Type: Article

References (18)

1. Ahuja, N.K.; Magnanti, T.L. & Orlin, J.B. (1993). Network Flows. Prentice Hall, Englewood Cliffs, NJ.
2. DIMACS (1991). The first DIMACS international algorithm implementation challenge: Problem definitions and specifications. World-Wide Web document.
3. DIMACS (1991). The first DIMACS international algorithm implementation challenge: The benchmark experiments. Technical report, DIMACS, New Brunswick, NJ.
4. El-Bakry, A.S.; Tapia, R.A. & Zhang, Y. (1994). A study on the use of indicators for identifying zero variables for interior-point methods. SIAM Review, 36, 45-72.
5. Gay, D.M. (1989). Stopping tests that compute optimal solutions for interior-point linear programming algorithms. Technical report, AT&T Bell Laboratories, Murray Hill, NJ.
6. Goldfarb, D. & Grigoriadis, M.D. (1988). A computational comparison of the Dinic and network simplex methods for maximum flow. Annals of Operations Research, 13, 83-123.
7. International Organization for Standardization (1997). Information technology - Programming languages - Fortran - Part 1: Base language. ISO/IEC 1539-1:1997, International Organization for Standardization, Geneva, Switzerland.
8. Karmarkar, N.K. & Ramakrishnan, K.G. (1991). Computational results of an interior point algorithm for large scale linear programming. Mathematical Programming, 52, 555-586.
9. McShane, K.A. & Monma, C.L. & Shanno, D.F. (1989). An implementation of a primal-dual interior point method for linear programming. ORSA Journal on Computing, 1, 70-83.
10. Mehrotra, S. & Ye, Y. (1993). Finding an interior point in the optimal face of linear programs. Mathematical Programming, 62, 497-516.
11. Portugal, L.; Bastos, F.; Júdice, J.; Paixão, J. & Terlaky, T. (1996). An investigation of interior point algorithms for the linear transportation problem. SIAM J. Sci. Computing, 17, 1202-1223.
12. Portugal, L.F.; Resende, M.G.C.; Veiga, G. & Júdice, J.J. (2000). A truncated primal-infeasible dual-feasible network interior point method. Networks, 35, 91-108.
13. Prim, R.C. (1957). Shortest connection networks and some generalizations. Bell System Technical Journal, 36, 1389-1401.
14. Resende, M.G.C. & Veiga, G. (1993). Computing the projection in an interior point algorithm: An experimental comparison. Investigación Operativa, 3, 81-92.
15. Resende, M.G.C. & Veiga, G. (1993). An efficient implementation of a network interior point method. In: Network Flows and Matching: First DIMACS Implementation Challenge [edited by David S. Johnson and Catherine C. McGeoch], volume 12 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 299-348. American Mathematical Society.
16. Resende, M.G.C. & Veiga, G. (1993). An implementation of the dual affine scaling algorithm for minimum cost flow on bipartite uncapacitated networks. SIAM Journal on Optimization, 3, 516-537.
17. Ye, Y. (1992). On the finite convergence of interior-point algorithms for linear programming. Mathematical Programming, 57, 325-335.
18. Yeh, Quey-Jen (1989). A reduced dual affine scaling algorithm for solving assignment and transportation problems. PhD thesis, Columbia University, New York, NY.