References
R.E. Bixby, “Solving real-world linear programs: A decade and more of progress,” Operations Research, vol. 50, no. 1, pp. 3–15, 2002.
R.E. Bixby, M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling, “MIP: Theory and practice closing the gap,” in M.J.D. Powell and S. Scholtes (Eds.), System Modelling and Optimization: Methods, Theory and Applications, Kluwer, The Netherlands, 2000, pp. 19–49.
J.R. Gilbert and T. Peierls, “Sparse partial pivoting in time proportional to arithmetic operations,” SIAM J. Sci. Stat. Comput., vol. 9, no. 5, pp. 862–874, 1988.
P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright, “A practical anti-cycling procedure for linearly constrained optimization,” Mathematical Programming, vol. 45, pp. 437–474, 1989.
J.A.J. Hall and K.I.M. McKinnon, “PARSMI, a parallel revised simplex algorithm incorporating minor iterations and Devex pricing,” in J. Waśniewski, J. Dongarra, K. Madsen, and D. Olesen (Eds.), Applied Parallel Computing, volume 1184 of Lecture Notes in Computer Science, Springer, pp. 67–76, 1996.
J.A.J. Hall and K.I.M. McKinnon, “ASYNPLEX, an asynchronous parallel revised simplex method algorithm,” Annals of Operations Research, vol. 81, pp. 27–49, 1998.
J.A.J. Hall and K.I.M. McKinnon, “The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling,” Mathematical Programming, vol. 100, no. 1, pp. 133–150, 2004.
J.A.J. Hall and K.I.M. McKinnon, “Hyper-sparsity in the revised simplex method and how to exploit it,” Computational Optimization and Applications, vol. 32, no. 3, pp. 259–283, 2005.
A. Koberstein, “The Dual Simplex Method - Techniques for a fast and stable implementation,” PhD thesis, University of Paderborn, 2005.
R. Lougee-Heimer, et al., “The COIN-OR initiative: Open source accelerates operations research progress,” ORMS Today, vol. 28, no. 4, pp. 20–22, 2001.
J.A. Tomlin, “Pivoting for size and sparsity in linear programming inversion routines,” J. Inst. Maths. Applics, vol. 10, pp. 289–295, 1972.
Additional information
Julian Hall received his BA in Mathematics from the University of Oxford in 1987 and his PhD from the University of Dundee in 1992. Since 1990 he has been employed as a lecturer in the School of Mathematics at the University of Edinburgh.
Ken McKinnon received his BSc in Mathematics and Physics from Glasgow University in 1969 and his PhD from the University of Cambridge in 1974. Since 1972 he has been employed as a lecturer, reader and professor in the School of Mathematics at the University of Edinburgh.
Rights and permissions
About this article
Cite this article
Hall, J., McKinnon, K. COAP 2005 Best Paper Award. Comput Optim Applic 35, 131–133 (2006). https://doi.org/10.1007/s10589-006-0311-z
Issue Date:
DOI: https://doi.org/10.1007/s10589-006-0311-z