Name
Abstract | ||
|---|---|---|
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. In this paper, 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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-24662-6_13 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
constraint satisfaction,branch and bound | Constraint satisfaction,Mathematical optimization,Formal description,Constraint satisfaction problem,Constraint satisfaction dual problem,Local search (optimization),Timetabling problem,Perturbation (astronomy),Calculus,Mathematics | Conference |
Volume | ISSN | Citations |
3010 | 0302-9743 | 8 |
PageRank | References | Authors |
0.77 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roman Barták | 1 | 332 | 69.15 |
| Tomás Müller | 2 | 52 | 5.68 |
| Hana Rudová | 3 | 349 | 25.55 |