Programmation par contraintes avec des fourmis (2008)
Khichane, Madjid, Albert, Patrick, Solnon, Christine
On explore dans cet article les possibilités dintégration de la métaheuristique doptimisation par colonies de fourmis (ACO) dans un langage de programmation par contraintes (PPC). Lidée est...
Programmation par contraintes avec des fourmis (2008)
Khichane, Madjid, Albert, Patrick, Solnon, Christine
On explore dans cet article les possibilités dintégration de la métaheuristique doptimisation par colonies de fourmis (ACO) dans un langage de programmation par contraintes (PPC). Lidée est...
Solnon, Christine, Cung, Van Dat, Nguyen, Alain, Artigues, Christian
The ROADEF challenge is organized every two years by the French Society of Operations Research and Decision-Making Aid. The goal is to allow industrial partners to witness recent developments in the...
Solnon, Christine, Cung, Van Dat, Nguyen, Alain, Artigues, Christian
The ROADEF challenge is organized every two years by the French Society of Operations Research and Decision-Making Aid. The goal is to allow industrial partners to witness recent developments in the...
Filtrage pour l'isomorphisme de sous-graphe (2007)
Zampelli, Stéphane, Deville, Yves, Solnon, Christine, Sorlin, Sébastien, Dupont, Pierre
On introduit ici un algorithme de filtrage dédié au problème de l'isomorphisme de sous-graphe consistant à décider s'il existe une copie d'un graphe motif dans un graphe cible. L'idée...
Filtrage pour l'isomorphisme de sous-graphe (2007)
Zampelli, Stéphane, Deville, Yves, Solnon, Christine, Sorlin, Sébastien, Dupont, Pierre
On introduit ici un algorithme de filtrage dédié au problème de l'isomorphisme de sous-graphe consistant à décider s'il existe une copie d'un graphe motif dans un graphe cible. L'idée...
Solnon, Christine, Cung, Van Dat, Nguyen, Alain, Artigues, Christian
The ROADEF challenge is organized every two years by the French Society of Operations Research and Decision-Making Aid. The goal is to allow industrial partners to witness recent developments in the...
Des fourmis pour le problème d'ordonnancement de voitures (2006)
Le problème d'ordonnancement de voitures consiste à séquencer des voitures sur une chaine de montage en satisfaisant des contraintes liées à la capacité des différents ateliers de montage...
Sorlin, Sébastien, Sammoud, Olfa, Solnon, Christine, Ghédira, Khaled
De nombreuses applications nécessitent de mesurer la similarité d'objets. Lorsque ces objets sont représentés par des graphes, la mesure de similarité se ramène à un problème d'appariement de...
Des fourmis pour le problème d'ordonnancement de voitures (2006)
Le problème d'ordonnancement de voitures consiste à séquencer des voitures sur une chaine de montage en satisfaisant des contraintes liées à la capacité des différents ateliers de montage...
Sorlin, Sébastien, Sammoud, Olfa, Solnon, Christine, Ghédira, Khaled
De nombreuses applications nécessitent de mesurer la similarité d'objets. Lorsque ces objets sont représentés par des graphes, la mesure de similarité se ramène à un problème d'appariement de...
Des fourmis pour le problème d'ordonnancement de voitures (2006)
Le problème d'ordonnancement de voitures consiste à séquencer des voitures sur une chaine de montage en satisfaisant des contraintes liées à la capacité des diff érents ateliers de montage...
Sorlin, Sébastien, Sammoud, Olfa, Solnon, Christine, Ghédira, Khaled
De nombreuses applications nécessitent de mesurer la similarité d'objets. Lorsque ces objets sont représentés par des graphes, la mesure de similarité se ramène à un problème d'appariement de...
An on-Line Course on Constraint Programming (2004)
This paper describes an on-line course on constraint programming.
Investigating ACO capabilities for solving the (2004)
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of pairwise adjacent...
Planning Operation: An Extension of a Geographical Information System (2004)
Claudia Zepeda Cortes, Christine Solnon, David Sol Martnez, Villeurbanne Cedex
The paper proposes to use CR-prolog to add planning capabilities to a Geographical Information System. Cr-rules can restore the consistency of a program giving the diagnosis of possible causes of...
A Global Constraint for Graph Isomorphism (2004)
Sbastien Sorlin, Christine Solnon
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very straightforward way, so...
Measuring the Similarity of Labeled Graphs (2003)
Pierre-antoine Champin, Christine Solnon
This paper proposes a similarity measure to compare cases represented by labeled graphs. We rst de ne an expressive model of directed labeled graph, allowing multiple labels on vertices and edges.
Jens Gottlieb, Markus Puchta, Christine Solnon
This paper describes and compares several heuristic approaches for the car sequencing problem. We rst study greedy heuristics, and show that dynamic ones clearly outperform their static counterparts.
Measuring the Similarity of Labeled Graphs (2003)
Pierre-antoine Champin, Christine Solnon
This paper proposes a similarity measure to compare cases represented by labeled graphs. We first define an expressive model of directed labeled graph, allowing multiple labels on vertices and edges.
Searching for Maximum Cliques with Ant Colony Optimization (2002)
In this paper, we investigate the capabilities of Ant Colony Optimization (ACO) for solving the maximum clique problem. We describe Ant-Clique, an algorithm that successively generates maximal...
Ants can solve Constraint Satisfaction Problems (2002)
In this paper we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to use artificial ants to...
Boosting ACO with a Preprocessing Step (2002)
When solving a combinatorial optimization problem with the Ant Colony Optimization (ACO) metaheuristic, one usually has to nd a compromise between guiding or diversifying the search. Indeed, ACO uses...
Boosting ACO with a Preprocessing Step (2001)
When solving a combinatorial optimization problem with the Ant Colony Optimization (ACO) metaheuristic, one usually has to find a compromise between guiding or diversifying the search. Indeed, ACO...
Ants can solve Constraint Satisfaction Problems (2001)
In this paper, we describe a new incomplete approach for solving Constraint Satisfaction Problems (CSPs) that is based on the Ant Colony Optimization (ACO) metaheuristic. The idea is to use...
Michel Rueher, Christine Solnon
. Systems combining an interval narrowing solver and a linear programming solver can tackle constraints over the reals that none of these solvers can handle on their own. In this paper we introduce a...
Cooperation of LP Solvers for Solving MILPs (2001)
A standard approach to solve Mixed Integer Linear Programs is to perform a global branch and bound search through all possible combinations. Due to the hardness of the problem, this search must be...
Solving Permutation Constraint Satisfaction Problems with Artificial Ants (2001)
We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on the observation of real ants...
Concurrent Cooperating Solvers over Reals (1997)
Michel Rueher, Christine Solnon
Systems combining an interval narrowing solver and a linear programming solver can tackle constraints over the reals that none of these solvers can handle on their own. In this paper we introduce a...
Sophia Antipolis, Erick Gallesio, Mireille Fornarino, Paul Franchi-zannettacci, Anne-marie Dery, Mdc Essi, ...
ion (du monde r#el) [11]. Cette approche permet de proposer une architecture originale dans des mondes homog#nes o# tout composant peut #tre d#crit par des d#pendances ou en mondes h#t#rog#nes o#...
Solnon, Christine, Cung, Van Dat, Nguyen, Alain, Artigues, Christian
The ROADEF challenge is organized every two years by the French Society of Operations Research and Decision-Making Aid. The goal is to allow industrial partners to witness recent developments in the...
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algorithm for solving...