SoPlex

SoPlex is a Linear Programming (LP) solver based on the revised simplex algorithm. It features preprocessing techniques, exploits sparsity, and offers primal and dual solving routines. It can be used as a standalone solver reading MPS or LP format files as well as embedded into other programs via a C++ class library. SoPlex has been implemented as a part of Roland Wunderling’s Ph.D. thesis Paralleler und Objektorientierter Simplex-Algorithmus (in German) and is available in source code. SoPlex is free for academic research and can be licensed for commercial use.


References in zbMATH (referenced in 54 articles , 1 standard article )

Showing results 1 to 20 of 54.
Sorted by year (citations)

1 2 3 next

  1. Gleixner, Ambros M.; Steffy, Daniel E.; Wolter, Kati: Iterative refinement for linear programming (2016)
  2. Maher, Stephen; Miltenberger, Matthias; Pedroso, João Pedro; Rehfeldt, Daniel; Schwarz, Robert; Serrano, Felipe: PySCIPOpt: mathematical programming in python with the SCIP optimization suite (2016)
  3. Gamrath, Gerald; Koch, Thorsten; Martin, Alexander; Miltenberger, Matthias; Weninger, Dieter: Progress in presolving for mixed integer programming (2015)
  4. Gamrath, Gerald; Melchiori, Anna; Berthold, Timo; Gleixner, Ambros M.; Salvagnin, Domenico: Branching on multi-aggregated variables (2015)
  5. Gleixner, Ambros M.: Exact and fast algorithms for mixed-integer nonlinear programming (2015)
  6. Hendel, Gregor: Enhancing MIP branching decisions by using the sample variance of pseudo costs (2015)
  7. Humpola, Jesco; Fügenschuh, Armin; Lehmann, Thomas: A primal heuristic for optimizing the topology of gas networks based on dual information (2015)
  8. Ma, Ding; Saunders, Michael A.: Solving multiscale linear programs using the simplex method in quadruple precision (2015)
  9. Berthold, Timo: RENS. The optimal rounding (2014)
  10. Ferreau, Hans Joachim; Kirches, Christian; Potschka, Andreas; Bock, Hans Georg; Diehl, Moritz: qpOASES: a parametric active-set algorithm for quadratic programming (2014)
  11. Gamrath, Gerald: Improving strong branching by domain propagation (2014)
  12. Berthold, Timo: Measuring the impact of primal heuristics (2013)
  13. Berthold, Timo; Salvagnin, Domenico: Cloud branching (2013)
  14. Cook, William; Koch, Thorsten; Steffy, Daniel E.; Wolter, Kati: A hybrid branch-and-bound approach for exact rational mixed-integer programming (2013)
  15. Heinz, Stefan; Ku, Wen-Yang; Beck, J.Christopher: Recent improvements using constraint integer programming for resource allocation and scheduling (2013)
  16. Jensen, Anders; Yu, Josephine: Computing tropical resultants (2013)
  17. Shapiro, Alexander; Tekaya, Wajdi; Soares, Murilo Pereira; Da Costa, Joari Paulo: Worst-case-expectation approach to optimization under uncertainty (2013)
  18. Althaus, Ernst; Dumitriu, Daniel: Certifying feasibility and objective value of linear programs (2012)
  19. Gleixner, Ambros M.; Held, Harald; Huang, Wei; Vigerske, Stefan: Towards globally optimal operation of water supply networks (2012)
  20. Gleixner, Ambros M.; Steffy, Daniel E.; Wolter, Kati: Improving the accuracy of linear programming solvers with iterative refinement (2012)

1 2 3 next