Network interior point bibliography: Single commodity flow

1. The projective transformation algorithm of Karmarkar: A computational experiment with assignment problems

   J. Aronson, R. Barr, R. Helgason, J. Kennington, A. Loh, and H. Zaki

   Technical Report 85-OR-3, Department of Operations Research, Southern Methodist University, Dallas, TX, August 1985.

2. Data structures and programming techniques for the implementation of Karmarkar's algorithm

   I. Adler, N. Karmarkar, M.G.C. Resende, and G. Veiga

   ORSA Journal on Computing, 1:84-106, 1989.

3. An implementation of Karmarkar's algorithm for linear programming

   I. Adler, N. Karmarkar, M.G.C. Resende, and G. Veiga

   Mathematical Programming, 44:297-335, 1989.

4. Computational comparison of the network simplex method with the affine scaling method

   A. Armacost and S. Mehrotra

   Opsearch, 28:26-43, 1991.

5. Exploiting special structure in a primal dual path-following algorithm

   I.C. Choi and D. Goldfarb

   Mathematical Programming, 58(1):33-52, 1993.

6. The AT&T KORBX System

   Y. C. Cheng, D. J. Houck, J. M. Liu, M. S. Meketon, L. Slutsman, R. J. Vanderbei, and P. Wang

   AT&T Technical Journal, 68:7-19, 1989.

7. Combinatorial interior point methods for generalized network flow problems

   D. Goldfarb and Y. Lin

   Mathematical Programming, 93:227-246, 2002.

8. A fast implementation of a path-following algorithm for maximizing a linear function over a network polytope

   A. Joshi, A.S. Goldstein, and P.M. Vaidya

   In D.S. Johnson and C.C. McGeoch, editors, Network Flows and Matching: First DIMACS Implementation Challenge, volume 12 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 267-298. American Mathematical Society, 1993.

9. Topics in optimization and sparse linear systems

   A. Joshi

   PhD thesis, University of Illinois, Urbana-Champaign, IL, 1996.

10. Computational results of an interior point algorithm for large scale linear programming

    N.K. Karmarkar and K.G. Ramakrishnan

    Mathematical Programming, 52:555-586, 1991.

11. A decomposition variant of the potential reduction algorithm for linear programming

    J.A. Kaliski and Y.Y. Ye

    Management Science, 39:757-776, 1993.

12. An investigation of interior point algorithms for the linear transportation problem

    L. Portugal, F. Bastos, J. Júdice, J. Paixão, and T. Terlaky

    SIAM J. Sci. Computing, 17:1202-1223, 1996.

13. Fortran subroutines for network flow optimization using an interior point algorithm

    J. Patrício, L.F. Portugal, M.G.C. Resende, G. Veiga, and J.J. Júdice

    Technical Report TD-5X2SLN, AT&T Labs Research, 2004.

14. A truncated primal-infeasible dual-feasible network interior point method

    L. Portugal, M.G.C. Resende, G. Veiga, and J. Júdice

    Networks, 35:91-108, 2000.

15. An empirical comparison of KORBX against RELAXT, a special code for network flow problems

    A. Rajan

    Technical report, AT&T Bell Laboratories, Holmdel, NJ, 1989.

16. An approximate dual projective algorithm for solving assignment problems

    K.G. Ramakrishnan, N.K. Karmarkar, and A.P. Kamath

    In D.S. Johnson and C.C. McGeoch, editors, Network Flows and Matching: First DIMACS Implementation Challenge, volume 12 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 431-451. American Mathematical Society, 1993.

17. Identifying the optimal face of a network linear program with a globally convergent interior point method

    M.G.C. Resende, T. Tsuchiya, and G. Veiga

    In W.W. Hager, D.W. Hearn, and P.M. Pardalos, editors, Large scale optimization: State of the art, pages 362-387. Kluwer Academic Publishers, 1994.

18. Computing the projection in an interior point algorithm: An experimental comparison

    M.G.C. Resende and G. Veiga

    Investigación Operativa, 3:81-92, 1993.

19. An efficient implementation of a network interior point method

    M.G.C. Resende and G. Veiga

    In D.S. Johnson and C.C. McGeoch, editors, Network Flows and Matching: First DIMACS Implementation Challenge, volume 12 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 299-348. American Mathematical Society, 1993.

20. An implementation of the dual affine scaling algorithm for minimum cost flow on bipartite uncapaciated networks

    M.G.C. Resende and G. Veiga

    SIAM Journal on Optimization, 3:516-537, 1993.

21. Sur l'implatation des méthodes de points intérieurs por la programmation linéaire

    G. Veiga

    PhD thesis, Université Paris 13, Institut Galilée, Paris, France, 1997.

22. A combinatorial interior point method for network flow problems

    C. Wallacher and U. Zimmermann

    Mathematical Programming, 56(3):321-335, 1992.

23. A reduced dual affine scaling algorithm for solving assignment and transportation problems

    Q.-J. Yeh

    PhD thesis, Columbia University, New York, NY, 1989.