Publication details

A New Approach to Modeling and Solving Minimal Perturbation Problems

Investor logo


Year of publication 2004
Type Article in Proceedings
Conference Recent Advances in Constraints
MU Faculty or unit

Faculty of Informatics

Field Informatics
Keywords constraint satisfaction; solution update; search; timetabling
Description Formulation of many real-life problems evolves when the problem is being solved. For example, a change in the environment might appear after the initial problem specification and this change must be reflected in the solution. Such changes complicate usage of a traditionally static constraint satisfaction technology that requires the problem to be fully specified before the solving process starts. We propose a new formal description of changes in the problem formulation called a minimal perturbation problem. This description focuses on the modification of the solution after a change in the problem specification. We also describe a new branch-and-bound like 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