Call for Papers & Participation
1st International Workshop on Local Search Techniques
in Constraint Satisfaction
At the Tenth International Conference on
27 September 2004
- 14:00 Opening Remarks. Justin Pearson, Markus
Bohlin, Magnus Ågren
- 14:10 Exploiting Relaxation in Local Search.
- 14:45 Iterative Forward Search: Combining Local Search
with Maintaining Arc Consistency and a Conflict-based
Statistics. Tomás Müller, Roman Barták and Hana Rudová.
- 15:20 Coffee Break
- 16:00 Stochastic solver for constraint satisfaction
problems with learning of high-level characteristics of the
problem topography. Yehuda Naveh.
- 16:35 On the impact of small-word constraint graphs on
local search. Andrea Roli.
- Iterative Forward Search: Combining Local Search with
Maintaining Arc Consistency and a Conflict-based Statistics.
Tomás Müller, Roman Barták and Hana Rudová.
- Stochastic solver for constraint satisfaction problems with
learning of high-level characteristics of the problem topography.
- On the impact of small-word constraint graphs on local
search. Andrea Roli.
- Exploiting Relaxation in Local Search. Steven Prestwich.
The proceedings are available from here.
Local search is an efficient method for solving hard combinatorial
(optimisation) problems. Problem instances that are still infeasible
for global search may be solvable using local search techniques. In
recent years, systems providing high-level modelling abstractions and
efficient solving mechanisms have evolved from the constraint
programming community. These systems provide general frameworks for
problem solving using neighbourhood techniques. Local search and
constraint satisfaction is an active area of research that attracts
and unites many different fields such as computer science and
This workshop will focus on any aspect concerning local search. This
includes, but is not limited to, new search heuristics,
meta-heuristics, techniques for (incremental) cost calculations, local
search systems, comparing or combining global and local search, and
applications solved using neighbourhood techniques.
Information for Participants
This will be a half-day workshop, open to anyone attending CP'04. At
least one author of an accepted submission must attend the
workshop. Anyone attending the workshop must pay the workshop
registration fee, as well as the CP'04 registration fee.
All submitted papers will be reviewed and accepted papers will be
given a presentation time slot at the workshop (subject to timing
constraints) and appear in the workshop proceedings. The proceedings
will be published online on this web page and hardcopies will be
distributed at CP'04.
To submit a paper, send an email, before the submission deadline
below, to email@example.com, with
title, abstract, the authors' names and emails, the name of the
corresponding author, and the paper in ps or pdf format. Please make
sure that the title and the abstract are in the email in text
format. The paper should not exceed 15 pages and be formatted using
the LNCS style.
|Submission deadline: ||21 July 2004
|Notifications: ||4 August 2004
|Camera-ready deadline: ||18 August 2004
|Workshop: ||27 September 2004
Justin Pearson (Main
Department of Information Technology, Division of
Computer Systems, Uppsala
University, Box 337, S-751 05 Uppsala, Sweden
+46 18 471 7292 (phone), +46 18 51 19 25 (fax); firstname.lastname@example.org
Swedish Institute of Computer Science (SICS), IDT/MdH, Vargens Vret,
S:ta Ursulas Väg 2A, Västerĺs, Sweden.
+46 21 10 70 23 (phone), +46 21 10 14 60 (fax);
Department of Information Technology, Division of Computing Science,
Uppsala University, Box 337, S-751 05 Uppsala, Sweden
+46 18 471
7894 (phone), +46 18 51 19 25 (fax); email@example.com
Markus Bohlin, SICS,
Justin Pearson, Uppsala
University, Uppsala, Sweden
Gilles Pesant, École
Polytechnique de Montréal, Montréal, Canada
Prestwich, University College, Cork, Ireland
Meinolf Sellmann, Cornell
University, Ithaca, NY, USA
Pascal Van Hentenryck,
Brown University, Providence, RI, USA
Magnus Ågren, Uppsala
University, Uppsala, Sweden
Last updated: 2004-04-21