QSopt-Exact. The objective of this software is to provide a solver for Linear Programming (and Integer Programming to a lesser degree) that returns true (rational) optimal solutions. It relies heavilly on the GNUMP library, that provides a multiprecision library for both floating point and also rational arithmetic. Note that if you use a dynamicly linked version of QSopt-Exact, then the GMP library should have been compiled with the option --enable-alloca=malloc-reentrant, this is needed to avoid memory corruption. The basis for the LP solver was taken from QSopt, which is an LP solver based on floating point arithmetic and available for free for research purposes. A brief description of the implementation and the obtained results can be obtained here (pdf), and a longer description (which is part of my Ph.D. thesis) can be found here Much of the functionality used in QSopt-Exact comes from EGlib.

References in zbMATH (referenced in 23 articles )

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

1 2 next

  1. Cheung, Kevin K. H.; Gleixner, Ambros; Steffy, Daniel E.: Verifying integer programming results (2017)
  2. Escobedo, Adolfo R.; Moreno-Centeno, Erick: Roundoff-error-free basis updates of LU factorizations for the efficient validation of optimality certificates (2017)
  3. Uchoa, Eduardo; Pecin, Diego; Pessoa, Artur; Poggi, Marcus; Vidal, Thibaut; Subramanian, Anand: New benchmark instances for the capacitated vehicle routing problem (2017)
  4. D’Andreagiovanni, Fabio; Gleixner, Ambros M.: Towards an accurate solution of wireless network design problems (2016)
  5. Gleixner, Ambros M.; Steffy, Daniel E.; Wolter, Kati: Iterative refinement for linear programming (2016)
  6. Kevin K. H. Cheung, Ambros Gleixner, Daniel E. Steffy: Verifying Integer Programming Results (2016) arXiv
  7. Müller, Stefan; Feliu, Elisenda; Regensburger, Georg; Conradi, Carsten; Shiu, Anne; Dickenstein, Alicia: Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry (2016)
  8. Escobedo, Adolfo R.; Moreno-Centeno, Erick: Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations (2015)
  9. Lagos, Guido; Espinoza, Daniel; Moreno, Eduardo; Vielma, Juan Pablo: Restricted risk measures and robust optimization (2015)
  10. Ma, Ding; Saunders, Michael A.: Solving multiscale linear programs using the simplex method in quadruple precision (2015)
  11. Ostrowski, James: Using symmetry to optimize over the Sherali-Adams relaxation (2014)
  12. Chvátal, Vašek; Cook, William; Espinoza, Daniel: Local cuts for mixed-integer programming (2013)
  13. Cook, William; Koch, Thorsten; Steffy, Daniel E.; Wolter, Kati: A hybrid branch-and-bound approach for exact rational mixed-integer programming (2013)
  14. Cornuéjols, Gérard; Margot, François; Nannicini, Giacomo: On the safety of Gomory cut generators (2013)
  15. Dalkiran, Evrim; Sherali, Hanif D.: Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (2013)
  16. Gago, J.; Hartillo, I.; Puerto, J.; Ucha, J. M.: Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method (2013)
  17. Gleixner, Ambros M.; Steffy, Daniel E.; Wolter, Kati: Improving the accuracy of linear programming solvers with iterative refinement (2012)
  18. Koch, Thorsten; Ralphs, Ted; Shinano, Yuji: Could we use a million cores to solve an integer program? (2012)
  19. Panyukov, A. V.; Gorbik, V. V.: Using massively parallel computations for absolutely precise solution of the linear programming problems (2012)
  20. Cook, William; Koch, Thorsten; Steffy, Daniel E.; Wolter, Kati: An exact rational mixed-integer programming solver (2011)

1 2 next