QPLIB: a library of quadratic programming instances

@inproceedings{Furini2018QPLIBAL,
  title={QPLIB: a library of quadratic programming instances},
  author={Fabio Furini and Emiliano Traversi and Pietro Belotti and Antonio Frangioni and Ambros M. Gleixner and Nick Gould and Leo Liberti and Andrea Lodi and Ruth Misener and Hans D. Mittelmann and Nikolaos V. Sahinidis and Stefan Vigerske and Angelika Wiegele},
  year={2018}
}
This paper describes a new instance library for Quadratic Programming (QP), i.e., the family of continuous and (mixed)-integer optimization problems where the objective function, the constrains, or both are quadratic. QP is a very “varied” class of problems, comprising sub-classes of problems ranging from trivial to undecidable. Solution methods for QP are very diverse, ranging from entirely combinatorial ones to completely continuous ones, including many for which both aspects are fundamental… CONTINUE READING
BETA

References

Publications referenced by this paper.
SHOWING 1-10 OF 135 REFERENCES

SBB

  • A. S. Drud
  • ARKI Consulting and Development A/S
  • 2017
2 Excerpts

Similar Papers

Loading similar papers…