Show simple item record

hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorFurini, Fabio
hal.structure.identifier
dc.contributor.authorTraversi, Emiliano
dc.date.accessioned2020-10-19T13:59:17Z
dc.date.available2020-10-19T13:59:17Z
dc.date.issued2014
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/21120
dc.language.isoenen
dc.subjectBinary Quadratic Programmingen
dc.subjectMax Cuten
dc.subjectQuadratic Stable Set Problemen
dc.subjectSemidefinite Programmingen
dc.subjectBounding Procedureen
dc.subject.ddc003en
dc.titleTwo useful computational tricks for Quadratic Programming: hybrid SDP bounding procedures and a new linearisation techniqueen
dc.typeCommunication / Conférence
dc.description.abstractenQuadratic programming problems have received an increasing amount of attention in the recent years, both from the theoretical and practical point of views. For this class of problems, we studied two different useful computational tricks.The first one is the exploitation of Semidefinite Programming (SDP) relaxation within the framework provided by Mixed Integer Nonlinear Programming (MINLP) solvers. We included the SDP relaxation in a state-of-the-art MINLP solver as an additional bounding technique and demonstrated that this idea could be computationally useful. The Quadratic Stable Set Problem is adopted as the case study. The tests indicate that the Hybrid SDP Bounding Procedure allows an average 50% cut of the overall computing time and a cut of more than one order of magnitude for the branching nodes.The second one is a new linearisation technique. We computationally prove that the new formulation, called Extended Linear Formulation, can be effective for different classes of problems in practice. Our tests are based on two sets of classical BQPs from the literature, i.e., the Unconstrained BQP and the Maximum Cut of edge-weighted graphs. Finally we discuss the relations between the Linear Programming relaxations of the different linearisation techniques presented and we discuss the elimination of constraint redundancy which is effective at speeding up the computational convergence.en
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.conftitle15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision (ROADEF 2014)en
dc.relation.confdate2014-02
dc.relation.confcityBordeauxen
dc.relation.confcountryFranceen
dc.relation.forthcomingnonen
dc.description.ssrncandidatenonen
dc.description.halcandidatenonen
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewednonen
dc.relation.Isversionofjnlpeerreviewednonen
dc.date.updated2020-10-19T13:56:51Z
hal.author.functionaut
hal.author.functionaut


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record