Skip to main content
SpringerLink
Log in

COAP 2015 Best Paper Prize

  • 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. COIN-OR. Clp. http://www.coin-or.org/projects/Clp.xml (2014). Accessed 11 Oct 2016

  2. Forrest, J.J.H., Tomlin, J.A.: Updated triangular factors of the basis to maintain sparsity in the product form simplex method. Math. Progr. 2, 263–278 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  3. Google. Glop. https://developers.google.com/optimization/lp/glop (2016). Accessed 11 Oct 2016

  4. Hall, J.A.J.: Towards a practical parallelisation of the simplex method. Comput. Manag. Sci. 7(2), 139–170 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hall, J.A.J., Huangfu, Q.: A high performance dual revised simplex solver. In: R. W., et al. (eds.) PPAM 2011. Part I, vol. 7203 of LNCS, pp. 143–151. Springer, Heidelberg (2012)

  6. Hall, J. A. J., McKinnon, K. I. M.: PARSMI, a parallel revised simplex algorithm incorporating minor iterations and Devex pricing. In:  Waśniewski, J.,  Dongarra, J.,  Madsen, K.,  Olesen, D. (eds.) , Applied parallel computing, vol. 1184 of lecture notes in computer science, pp. 67–76. Springer, Berlin (1996)

  7. Hall, J.A.J., McKinnon, K.I.M.: ASYNPLEX, an asynchronous parallel revised simplex method algorithm. Ann. Oper. Res. 81, 27–49 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hall, J.A.J., McKinnon, K.I.M.: Hyper-sparsity in the revised simplex method and how to exploit it. Comput. Optim. Appl. 32(3), 259–283 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Huangfu, Q., Hall, J. A. J.: Parallelizing the dual revised simplex method. Mathematical programming computation, Accepted for publication (2016)

  10. Lubin, M., Hall, J.A.J., Petra, C.G., Anitescu, M.: Parallel distributed-memory simplex for large-scale stochastic LP problems. Comput. Optim. Appl. 55(3), 571–596 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  11. Mittelmann, H. D.: Benchmark of simplex lp solvers. http://plato.asu.edu/ftp/lpsimp.html( 2016). Accessed 11 Oct 2016

  12. Rosander, R.R.: Multiple pricing and suboptimization in dual linear programming algorithms. Math. Progr. Stud. 4, 108–117 (1975)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

COAP 2015 Best Paper Prize. Comput Optim Appl 65, 541–544 (2016). https://doi.org/10.1007/s10589-016-9882-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-016-9882-5

Search

Navigation