Attributes | Values |
---|
rdf:type
| |
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 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.
- 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. (en)
|
Title
| - A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report
- A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report (en)
|
skos:prefLabel
| - A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report
- A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report (en)
|
skos:notation
| - RIV/00216224:14330/03:00008701!RIV/2004/GA0/143304/N
|
http://linked.open.../vavai/riv/strany
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216224:14330/03:00008701
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - constraint satisfaction; solution update; search (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Proceedings of the 22nd Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG)
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...ocetUcastnikuAkce
| |
http://linked.open...nichUcastnikuAkce
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Barták, Roman
- Müller, Tomáš
- Rudová, Hana
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
issn
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| - University of Strathclyde
|
http://localhost/t...ganizacniJednotka
| |