Skip to main content
SpringerLink
Log in

COAP 2005 Best Paper Award

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. R.E. Bixby, “Solving real-world linear programs: A decade and more of progress,” Operations Research, vol. 50, no. 1, pp. 3–15, 2002.

    Article  MathSciNet  Google Scholar 

  2. 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.

  3. 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.

    Article  MATH  MathSciNet  Google Scholar 

  4. 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.

    Article  MATH  MathSciNet  Google Scholar 

  5. 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.

  6. 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.

    Article  MATH  MathSciNet  Google Scholar 

  7. 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.

    Article  MATH  MathSciNet  Google Scholar 

  8. 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.

    Article  MATH  MathSciNet  Google Scholar 

  9. A. Koberstein, “The Dual Simplex Method - Techniques for a fast and stable implementation,” PhD thesis, University of Paderborn, 2005.

  10. 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.

    Google Scholar 

  11. J.A. Tomlin, “Pivoting for size and sparsity in linear programming inversion routines,” J. Inst. Maths. Applics, vol. 10, pp. 289–295, 1972.

    MATH  MathSciNet  Google Scholar 

Download references

Authors
  1. Julian Hall
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ken McKinnon
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-006-0311-z

Keywords

Search

Navigation