dc.contributor.author | Samer, Phillippe | |
dc.contributor.author | Haugland, Dag | |
dc.date.accessioned | 2021-06-24T11:19:29Z | |
dc.date.available | 2021-06-24T11:19:29Z | |
dc.date.created | 2021-01-29T13:55:37Z | |
dc.date.issued | 2021 | |
dc.identifier.isbn | 978-3-030-63071-3 | |
dc.identifier.uri | https://hdl.handle.net/11250/2761120 | |
dc.description.abstract | Given 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.iso | eng | en_US |
dc.publisher | Springer | en_US |
dc.relation.ispartof | Graphs and Combinatorial Optimization: from Theory to Applications - CTW2020 Proceedings | |
dc.title | The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope | en_US |
dc.type | Chapter | en_US |
dc.description.version | acceptedVersion | en_US |
dc.rights.holder | Copyright 2020 Springer | en_US |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 1 | |
dc.identifier.doi | https://doi.org/10.1007/978-3-030-63072-0_9 | |
dc.identifier.cristin | 1882490 | |
dc.source.pagenumber | 115-124 | en_US |
dc.identifier.citation | In: Gentile C., Stecca G., Ventura P. (eds) Graphs and Combinatorial Optimization: from Theory to Applications. AIRO Springer Series, vol 5. pp 107-116 | en_US |
dc.source.volume | 5 | en_US |