at the
International Conference on
Applications of Declarative Programming
and Knowledge Management
University of Würzburg, Germany
October 4-6, 2007
Scope
The scope of the Constraints Track is focused on the modeling and processing of combinatorial problems, such as
job-shop scheduling
flow-shop scheduling
material requirements planning
supply chain management
configuration
timetabling
personnel rostering
and others.
Contributions on new algorithms, problem encodings, heuristics, and paradigms, etc. within the areas
operations research
linear and integer programming
branch-and-bound optimisation
constraint satisfaction
local search
heuristics
and others
are welcome.
We solicit R&D submissions presenting solutions of large real-world, e.g. industrial,
commerical, or administrative problems and hyrbid approaches combining several paradigms like
Constraint, Integer, Linear Programming, or Local Seach especially with Object-
or Service-Orientation.