1st International Workshop on Local Search Techniques
in Constraint Satisfaction

LSCS'04

Programme

• 14:00 Opening Remarks. Justin Pearson, Markus Bohlin, Magnus Ågren
• 14:10 Exploiting Relaxation in Local Search. Steven Prestwich.
• 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.

Accepted Papers

• 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. Yehuda Naveh.
• 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.

Overview

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 mathematics.

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.

Paper Submission

To submit a paper, send an email, before the submission deadline below, to lscs04@list.it.uu.se, 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.

Important Dates

Organisation

Workshop Organisers

Program Committee