Call for Participation: MASTER CLASS ON GRAPH THEORY AND CONSTRAINT PROGRAMMING
From: Michel Rueher (rueher_at_essi.fr)
Date: 03/18/04
- Next message: Dhruv Matani: "Re: The complexity of a piece of code"
- Previous message: John F: "Re: data structures language"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Thu, 18 Mar 2004 14:46:20 +0100
MASTER CLASS ON GRAPH THEORY AND CONSTRAINT PROGRAMMING
Nice, France, April 19, 2004
In conjunction with CP-AI-OR'04
Graph Theory is an extremely wide research area involving Mathematics
and Operations Research.
Graph Theory concerns both algorithms for problems arising on graphs and
applications whose
underlying structure can be represented thorough a graph. Results coming
from graph theory
have been always successfully applied to Mathematical Programming and,
more recently, they
become crucial also in the Constraint Programming (CP) area. For
instance, many Graph Theory
algorithms have been used as filtering algorithms in global constraints
and many applications based
on the graph representation have been solved through CP.
The Master Class is mainly intended for PhD students, researchers and
practitioners and it is aimed
at presenting the state-of-the-art of the integration between Graph
Theory and Constraint Programming.
In particular, the class will give an overview of Graph Theory classical
and recent results which
have been applied in the Constraint Programming context as filtering
algorithms and to discuss
Graph Theory applications which has been solved using hybrid methods
involving Constraint
Programming. An introduction to Graph Theory algorithms will be given as
a first step.
The Master Class day is organized as follows: after an introduction on
Graph Theory, the rest of
the morning will be devoted to Graph Theory results embedded into global
constraints, while
the afternoon will concern Graph Theory applications.
For attending the Master Class, a Constraint Programming background is
required.
Soon after the Master Class, the CP-AI-OR conference will take place, a
major forum on
the Integration of OR and AI techniques in CP.
We invite you to register to Master Class before the 1st of April
(see http://www-sop.inria.fr/coprin/cpaior04/) as the number of hotel
rooms are limited.
Talks :
Filtering Algorithms based on Graph Theory
Jean-Charles Regin, ILOG S.A., France
Assignment-based relaxation in CP
Andrea Lodi, Bologna University, Italy
Temporal Graphs in Scheduling
Philippe Laborie, ILOG S.A., France
Constraint Applications using Graph Theory Results
Helmut Simonis, Parc Technologies Ltd., UK
Human solvers are still better than CP solvers : The case of the
bandwidth problem
Alberto Caprara, Bologna University, Italy
CO-Organizers :
Andrea Lodi
DEIS - University of Bologna
V.le Risorgimento 2
40136 Bologna
Italy
email: alodi@deis.unibo.it
Michela Milano
DEIS - University of Bologna
V.le Risorgimento 2
40136 Bologna
Italy
email: mmilano@deis.unibo.it
Local Organization :
Claude Michel
University of Nice-Sophia Antipolis
- Next message: Dhruv Matani: "Re: The complexity of a piece of code"
- Previous message: John F: "Re: data structures language"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|
