6th International Workshop on Local Search Techniques
in Constraint Satisfaction

LSCS'09

Programme

• 9h15/10h15: Invited talk
  • T. Stuetzle. Engineering Stochastic Local Search
• 10h15/10h45: Coffee break
• 10h45/12h15: Morning session
  • 10h45/11h15: G. Audemard, J.-M. Lagniez, B. Mazure, and L. Sais. Integrating Conflict Driven Clause Learning to Local Search
  • 11h15/11h45: Q. Pham, Y. Deville, and P. Van Hentenryck. A Local Search Modeling for Constrained Optimum Paths Problems
  • 11h45/12h00: F. He and R. Qu. A Constraint-directed Local Search Approach to Nurse Rostering Problems
  • 12h00/12h15: S. Abreu, P. Codognet, and D. DIAZ. Parallel local search for solving Constraint Problems on the Cell Broadband Engine (Preliminary Results)
• 12h15/14h00: Lunch
• 14h00/15h45: Afternoon session
  • 14h00/14h30: D. Pereira, I. Lynce, and S. Prestwich. On Improving Local Search for Unsatisfiabilemy
  • 14h30/15h00: F. Hassani Bijarbooneh, P. Flener, and J. Pearson. Dynamic Demand-Capacity Balancing for Air Traffic Management Using Constraint-Based Local Search: First Results
  • 15h00/15h30: J. He, P. Flener, and J. Pearson. An automaton Constraint for Local Search
  • 15h30/15h45: M. Pelleau, P. Van Hentenryck, and C. Truchet. Sonet Network Design Problems

Overview and scope

LSCS is an annual workshop, since 2004, devoted to local search techniques in constraint satisfaction. This workshop focuses on all aspects of local search techniques, including: design and implementation of new algorithms, hybrid stochastic-systematic search, reactive search optimization, adaptive search, modeling for local-search, global constraints, flexibility and robustness, learning methods, and specific applications. The workshop will provide an informal environment for discussions about recent results in these and related areas. Papers are solicited from the above areas or from any other area related to local search in constraint satisfaction. In addition to contributed papers, we will have one invited lecture and will also provide opportunities for short presentations of post-deadline important results.

Proceedings

Papers accepted for presentations will be published as an issue of Electronic Proceedings in Theoretical Computer Science.

Submissions

Authors should prepare their full papers in the LNCS/LNAI format, by following Springer instructions. The maximum is 15 pages. Extended abstracts of post-deadline important results should be no longer than two pages, including figures and references. Papers should be submitted with EasyChair. Papers and abstracts submitted to the workshop will be reviewed by at least two members of the program committee.

Important Dates

Previous LSCSs

• 5th Workshop (2008)
• 4th Workshop (2007)
• 3rd Workshop (2006)
• 2nd Workshop (2005)
• 1st Workshop (2004)
• Full list

Information for Participants

At least one author of an accepted submission must attend the workshop. The workshop will be open to all members of the CP community. All workshop participants must pay the CP registration fee in addition to the workshop fee. The proceedings will be published online on this web page.

Organisation

Workshop Organisers

• Yves Deville, Department of Computing Science and Engineering, Universite catholique de Louvain, Belgium (Yves dot Deville at uclouvain dot be)
• Christine Solnon, LIRIS, Universite Lyon 1, France (christine dot solnon at liris dot cnrs dot fr)

Program Committee

• Roberto Battiti, Università degli Studi di Trento, Italy
• Chris Beck, University of Toronto, Canada
• Yves Deville, UCLouvain, Belgique
• Pierre Flener, Uppsala University, Sweden
• Laurent Michel, University of Connecticut, USA
• Yehuda Naveh, IBM Research, Israel
• Bertrand Neveu, INRIA, France
• Steven Prestwich, 4C, Ireland
• Andrea Roli, Università Bologna, Italy
• Christine Solnon, Université Lyon 1, France
• Thomas Stuetzle, Université Libre de Bruxelles, Belgium
• Pascal Van Hentenryck, Brown University, USA