QSopt_ex Rational LP Solver: The QSopt code is based on floating-point arithmetic and the results are subject to rounding errors, as is the case with other commerical and academic linear-programming solvers. For the exact solution of LP problems, we have created the QSopt_ex rational solver and callable library. This package makes use of the GNU MP Bignum Library to deliver the exact rational solution to LP instances having rational input. This code may be used under the terms of the GNU General Public License (Version 2.1 or later) as published by the Free Software Foundation. Alternatively, use is granted for research purposes only. It is your choice of which of these two licenses you are operating under. The source code for Qsopt_ex 2.6 (090408) can be downloaded here, as a gzipped tar file. This is a simplified version of the full development code. It has been tested under Linux (various distributions), Mac OS 10.5, Cygwin, Solaris 9, and AIX. The QSopt_ex research is supported supported by Office of Naval Research Grant N00014-03-1-0040 and National Science Foundation Grant CMMI-0726370. (Source: http://plato.asu.edu)

References in zbMATH (referenced in 15 articles )

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

  1. Escobedo, Adolfo R.; Moreno-Centeno, Erick: Roundoff-error-free basis updates of LU factorizations for the efficient validation of optimality certificates (2017)
  2. D’Andreagiovanni, Fabio; Gleixner, Ambros M.: Towards an accurate solution of wireless network design problems (2016)
  3. Gleixner, Ambros M.; Steffy, Daniel E.; Wolter, Kati: Iterative refinement for linear programming (2016)
  4. 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)
  5. Escobedo, Adolfo R.; Moreno-Centeno, Erick: Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations (2015)
  6. Ostrowski, James: Using symmetry to optimize over the Sherali-Adams relaxation (2014)
  7. van den Heuvel, Jan; Král’, Daniel; Kupec, Martin; Sereni, Jean-Sébastien; Volec, Jan: Extensions of fractional precolorings show discontinuous behavior (2014)
  8. Cook, William; Koch, Thorsten; Steffy, Daniel E.; Wolter, Kati: A hybrid branch-and-bound approach for exact rational mixed-integer programming (2013)
  9. Dalkiran, Evrim; Sherali, Hanif D.: Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (2013)
  10. Simari, Gerardo I.; Martinez, Maria Vanina; Sliva, Amy; Subrahmanian, V.S.: Focused most probable world computations in probabilistic logic programs (2012)
  11. Cook, William; Koch, Thorsten; Steffy, Daniel E.; Wolter, Kati: An exact rational mixed-integer programming solver (2011)
  12. Dash, Sanjeeb; Goycoolea, Marcos: A heuristic to generate rank-1 GMI cuts (2010)
  13. Jansson, Christian; Chaykin, Denis; Keil, Christian: Rigorous error bounds for the optimal value in semidefinite programming (2008)
  14. Applegate, David L.; Cook, William; Dash, Sanjeeb; Espinoza, Daniel G.: Exact solutions to linear programming problems (2007)
  15. Dash, Sanjeeb; Günlük, Oktay: Valid inequalities based on the interpolation procedure (2006)