A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F03%3A00008701" target="_blank" >RIV/00216224:14330/03:00008701 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report
Original language description
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 theseconstraints 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.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA201%2F01%2F0942" target="_blank" >GA201/01/0942: Advanced Planning and Scheduling</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 22nd Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG)
ISBN
1368-5708
ISSN
—
e-ISSN
—
Number of pages
11
Pages from-to
1
Publisher name
University of Strathclyde
Place of publication
Glasgow (United Kingdom)
Event location
Glasgow (United Kingdom)
Event date
Dec 9, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)