d-extensibles, d-bloqueurs et d-transversaux de problèmes d'optimisation combinatoire

Abstract : In this thesis, we study three types of problems : the d-extensibles sets, the d-blockers and the d-transversals.In a graph G, a d-extensible set of maximum independent sets is a subset of vertices of G such that every stable set of cardinality d in the subgraph restricted to the d-extensible set can be extented to a maximum stable set of G using only vertices that do not belong to the d-extensible set. We study d-extensible sets of mxaimum cardinality of stable sets in bipartite graphs. We show some structural properties and we determine a lower bound of the maximum cardinality of a d-extensible set. We consider some classes of graph where finding an optimum d-extensible set can be done in polynomial time. Then, we study the d-extensibles sets of stable sets in trees. We prove some properties on the structures of the d-extensibles sets and we determine another lower bound of the maximum cardinality of a d-extensible set. Finaly, we study somme classes of tree where a d-extensible sets of maximum cardinality can be done in polynomial time.In a graph G, a d-blocker is a subset of vertices such that, if removed, a maximum stable set of the resulting subgraph is of cardinality at most the cardinality of a maximum stable set of G minus d. We study d-blocker of minimal cost of stable sets in tree.We prove a caracterisation of d-blockers in tree and we study a particular classe of trees where computing a d-blocker of minimal cost of stable sets can be done in polynomial time.Let Pi be an optimisation problem on a finite set of elements. A d-transversal of Pi is a subset of elements such that the intersection between the d-transversal and every optimal solution of Pi contains at lest d elements. We propose an approach to compute d-transversal of any optimisation problem modelised by mathematical program with binary variables. We use a contraints generation approach. We compare two variations of this approach on randomly generated graph by computing d-transversals of stables sets and d-transversals of matching
Document type :
Theses
Complete list of metadatas

Cited literature [79 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01445980
Contributor : Abes Star <>
Submitted on : Wednesday, January 25, 2017 - 2:59:06 PM
Last modification on : Saturday, December 21, 2019 - 3:45:02 AM
Long-term archiving on: Wednesday, April 26, 2017 - 3:07:35 PM

File

COTTE_2016.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01445980, version 1

Collections

Citation

Grégoire Cotté. d-extensibles, d-bloqueurs et d-transversaux de problèmes d'optimisation combinatoire. Recherche opérationnelle [cs.RO]. Conservatoire national des arts et metiers - CNAM, 2016. Français. ⟨NNT : 2016CNAM1037⟩. ⟨tel-01445980⟩

Share

Metrics

Record views

249

Files downloads

130