Publication details

Minimal Perturbation Problem - A Formal View

Investor logo


Year of publication 2003
Type Article in Proceedings
Conference Proceedings of ERCIM Working Group on Constraints/CompulogNet Area on "Constraint Programming" Workshop
MU Faculty or unit

Faculty of Informatics

Field Informatics
Keywords constraint satisfaction; solution update; timetabling
Description Formulation of many real-life problems evolves as the problem is being solved. These changes are typically initiated by a user intervention or by changes in the environment. However, the traditional formulation of the constraint satisfaction problem is static in the sense that it must be fully specified before the solving process starts. We propose a formal description of so called minimal perturbation problem that allows an automated modification of the (partial) solution when the problem formulation changes. We also discuss a first proposal of the algorithm for solving such type of problems.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info