Proceedings 6th International Workshop on Local Search Techniques in Constraint Satisfaction

10/08/2009
by   Yves Deville, et al.
0

LSCS is a satellite workshop of the international conference on principles and practice of Constraint Programming (CP), since 2004. It is devoted to local search techniques in constraint satisfaction, and 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.

READ FULL TEXT
research
10/07/2009

Toward an automaton Constraint for Local Search

We explore the idea of using finite automata to implement new constraint...
research
01/29/2014

Propagators and Violation Functions for Geometric and Workload Constraints Arising in Airspace Sectorisation

Airspace sectorisation provides a partition of a given airspace into sec...
research
09/03/2015

Building a Truly Distributed Constraint Solver with JADE

Real life problems such as scheduling meeting between people at differen...
research
02/15/2004

Computational complexity and simulation of rare events of Ising spin glasses

We discuss the computational complexity of random 2D Ising spin glasses,...
research
10/07/2009

A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract)

Constrained Optimum Path (COP) problems appear in many real-life applica...
research
11/27/2014

Unweighted Stochastic Local Search can be Effective for Random CSP Benchmarks

We present ULSA, a novel stochastic local search algorithm for random bi...
research
10/07/2009

A Constraint-directed Local Search Approach to Nurse Rostering Problems

In this paper, we investigate the hybridization of constraint programmin...

Please sign up or login with your details

Forgot password? Click here to reset