Informace o publikaci
A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report
| Autoři | |
|---|---|
| Rok publikování | 2003 |
| Druh | Článek ve sborníku |
| Konference | Proceedings of the 22nd Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG) |
| Fakulta / Pracoviště MU | |
| Citace | |
| www | http://www.fi.muni.cz/~hanka/publications.html |
| Obor | Informatika |
| Klíčová slova | constraint satisfaction; solution update; search |
| Popis | Solving real-life planning, scheduling, and timetabling problems is usually an iterative process in which, after seeing the generated solution, users may change the problem constraints. This change requires producing a new solution which satisfies these constraints but not being too far from the original solution. This type of problem is called a minimal perturbation problem. The paper formally describes a minimal perturbation problem in the context of constraint satisfaction and it proposes a new depth-first search algorithm for solving a particular instance of the minimal perturbation problem. |
| Související projekty: |