QPLIB: a library of quadratic programming instances - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Mathematical Programming Computation Année : 2019

QPLIB: a library of quadratic programming instances

Résumé

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 and/or the constraints are quadratic. QP is a very diverse class of problems, comprising sub-classes ranging from trivial to undecidable. This diversity is reflected in the variety of QP solution methods, ranging from entirely combinatorial approaches to completely continuous algorithms, including many methods for which both aspects are fundamental. Selecting a set of instances of QP that is at the same time not overwhelmingly onerous but sufficiently challenging for the different, interested communities is therefore important. We propose a simple taxonomy for QP instances leading to a systematic problem selection mechanism. We then briefly survey the field of QP, giving an overview of theory, methods and solvers. Finally, we describe how the library was put together, and detail its final contents.
Fichier principal
Vignette du fichier
5846.pdf (562.03 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02177672 , version 1 (09-07-2019)

Identifiants

Citer

Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros Gleixner, et al.. QPLIB: a library of quadratic programming instances. Mathematical Programming Computation, 2019, 11 (2), ⟨10.1007/s12532-018-0147-4⟩. ⟨hal-02177672⟩
195 Consultations
601 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More