Skip to main content
SpringerLink
Log in

COAP 2013 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. Hall, J.A.J.: Towards a practical parallelisation of the simplex method. Comput. Manag. Sci. 7(2), 139–170 (2010)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  3. 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, Volume 1184 of Lecture Notes in Computer Science, pp. 67–76. Springer, Berlin (1996)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. 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  MATH  MathSciNet  Google Scholar 

  6. Huangfu, Q., Hall, J. A. J.: Parallelizing the dual revised simplex method. Technical Report ERGO-14-011, School of Mathematics, University of Edinburgh (2014)

  7. Lougee-Heimer, R., et al.: The COIN-OR initiative: open source accelerates operations research progress. ORMS Today 28(4), 20–22 (2001)

    Google Scholar 

  8. Lubin, M., Petra, C. G., Anitescu, M., Zavala, V.: Scalable stochastic optimization of complex energy systems. In Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, SC ’11, pages 64:1–64:64, ACM, New York (2011)

  9. Petra, C.G., Anitescu, M.: A preconditioning technique for Schur complement systems arising in stochastic optimization. Comput. Optim. Appl. 52, 315–344 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  10. Petra, C.G., Schenk, O., Anitescu, M.: Real-time stochastic optimization of complex energy systems on high performance computers. Comput. Sci. Eng. 99(PrePrints), 1–9 (2014)

    Google Scholar 

  11. Petra, C.G., Schenk, O., Lubin, M., Gärtner, K.: An augmented incomplete factorization approach for computing the Schur complement in stochastic optimization. SIAM J. Sci. Comput. 36(2), C139–C162 (2014)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. Smith, E.: Parallel solution of linear programs. PhD thesis, University of Edinburgh (2013)

Download references

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

COAP 2013 Best Paper Prize. Comput Optim Appl 59, 399–403 (2014). https://doi.org/10.1007/s10589-014-9707-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-014-9707-3

Search

Navigation