Show simple item record

dc.contributor.authorLallo Dias, Phillippe Samer
dc.contributor.authorHaugland, Dag
dc.date.accessioned2021-06-24T11:19:29Z
dc.date.available2021-06-24T11:19:29Z
dc.date.created2021-01-29T13:55:37Z
dc.date.issued2021
dc.identifier.isbn978-3-030-63071-3
dc.identifier.urihttps://hdl.handle.net/11250/2761120
dc.descriptionUnder embargo until: 2021-11-09en_US
dc.description.abstractGiven an undirected graph G = (V, E) and an integer k∈{1,…,|V|} , we initiate the combinatorial study of stable sets of cardinality exactly k in G. Our aim is to instigate the polyhedral investigation of the convex hull of fixed cardinality stable sets, and we begin by introducing a large class of valid inequalities to the natural integer programming formulation of the problem.en_US
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.relation.ispartofGraphs and Combinatorial Optimization: from Theory to Applications - CTW2020 Proceedings
dc.titleThe unsuitable neighbourhood inequalities for the fixed cardinality stable set polytopeen_US
dc.typeChapteren_US
dc.description.versionacceptedVersionen_US
dc.rights.holderCopyright 2020 Springeren_US
cristin.ispublishedtrue
cristin.fulltextpostprint
cristin.qualitycode1
dc.identifier.doihttps://doi.org/10.1007/978-3-030-63072-0_9
dc.identifier.cristin1882490
dc.source.pagenumber115-124en_US
dc.identifier.citationIn: Gentile C., Stecca G., Ventura P. (eds) Graphs and Combinatorial Optimization: from Theory to Applications. AIRO Springer Series, vol 5. pp 107-116en_US
dc.source.volume5en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record