Show simple item record

dc.contributor.authorDiarrassouba, Ibrahima
dc.contributor.authorMahjoub, Meriem
dc.contributor.authorMahjoub, Ali Ridha
dc.contributor.authorTaktak, Raouia
dc.date.accessioned2020-05-14T11:29:23Z
dc.date.available2020-05-14T11:29:23Z
dc.date.issued2016
dc.identifier.issn1571-0653
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/20737
dc.language.isoenen
dc.subjectk-node connected graphen
dc.subjectpolytopeen
dc.subjectseparationen
dc.subjectbranch-and-cuten
dc.subject.ddc005en
dc.titleThe k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cuten
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenIn this paper we consider the k-node connected subgraph problem. We propose an integer linear programming formulation for the problem and investigate the associated polytope. We introduce further classes of valid inequalities and discuss their facial aspect. We also devise separation routines and discuss some reduction operations that can be used in a preprocessing phase for the separation. Using those results, we devise a Branch-and-Cut algorithm and present some preliminary computational results.en
dc.relation.isversionofjnlnameElectronic Notes in Discrete Mathematics
dc.relation.isversionofjnlvol52en
dc.relation.isversionofjnldate2016-06
dc.relation.isversionofjnlpages117-124en
dc.relation.isversionofdoi10.1016/j.endm.2016.03.016en
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelProgrammation, logiciels, organisation des donnéesen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenonen
dc.description.halcandidatenonen
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2020-05-14T11:19:58Z
hal.person.labIds87
hal.person.labIds989
hal.person.labIds989
hal.person.labIds989


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