Harald Meyer auf'm Hofe: Benefits and Problems of Using Cycle-Cutset Within Iterative Improvement Algorithms
in: ECAI-2000 Workshop PuK 2000.
Abstract:
Some experiments on randomly generated partial constraint satisfaction
problems as well as an example from the domain of real world nurse
rostering illustrate the advantage of the cyclecutset method as a
repair step in iterative search. These results motivate the integration
of adopted algorithms on solving tree-structured constraint problems
and the cycle-cutset method into modern constraint-based optimization
with branch-and-bound and propagation of global constraints.
|
Imprint
