HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Theses

Exploitation de structures de graphe en programmation par contraintes

Jean-Guillaume Fages 1, 2
2 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Abstract : Many IT applications require to solve decision problems which are hard from a mathematical point of view. Constraint-programming enables to model and solve some of these problems. Among them, some are defined over graphs. Beyond the difficulty stemming from each of these problems, the size of the instance to solve increases the difficulty of the task. This PhD thesis is about the use of graphs within constraint programming, in order to improve its scalability. First, we study the use of constraint-programming to solve some graph problems involving the computation of trees and Hamiltonian paths and cycles. These problems are important and can be found in many industrial applications. Both filtering and search are investigated. Next, we move on problems which are no longer defined in terms of graph properties. We then study the use of graphs to propagate global constraints. In particular, we suggest a generic schema, relying ona graph structure, to dynamically decompose filtering algorithms. The central theme in this work is the use of graph concepts at the origin of every reasoning and the practical will to increase the size of problems that can be addressed in constraint-programming.
Complete list of metadata

Cited literature [90 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01085253
Contributor : Abes Star :  Contact
Submitted on : Friday, November 21, 2014 - 8:51:58 AM
Last modification on : Wednesday, April 27, 2022 - 4:40:44 AM
Long-term archiving on: : Monday, February 23, 2015 - 8:56:55 AM

File

Fages_Jg_10_2014.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01085253, version 1

Citation

Jean-Guillaume Fages. Exploitation de structures de graphe en programmation par contraintes. Algorithme et structure de données [cs.DS]. Ecole des Mines de Nantes, 2014. Français. ⟨NNT : 2014EMNA0190⟩. ⟨tel-01085253⟩

Share

Metrics

Record views

704

Files downloads

3504