Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{555153,
author = {Barták, Roman and Müller, Tomáš and Rudová, Hana},
address = {Glasgow (United Kingdom)},
booktitle = {Proceedings of the 22nd Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG)},
keywords = {constraint satisfaction; solution update; search},
language = {eng},
location = {Glasgow (United Kingdom)},
pages = {1-11},
publisher = {University of Strathclyde},
title = {A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report},
url = {http://www.fi.muni.cz/~hanka/publications.html},
year = {2003}
}
TY - JOUR
ID - 555153
AU - Barták, Roman - Müller, Tomáš - Rudová, Hana
PY - 2003
TI - A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report
PB - University of Strathclyde
CY - Glasgow (United Kingdom)
KW - constraint satisfaction
KW - solution update
KW - search
UR - http://www.fi.muni.cz/~hanka/publications.html
N2 - 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.
ER -
BARTÁK, Roman, Tomáš MÜLLER a Hana RUDOVÁ. A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report. In \textit{Proceedings of the 22nd Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG)}. Glasgow (United Kingdom): University of Strathclyde, 2003, s.~1-11. ISSN~1368-5708.
|
