Limited Assignment Number Search Algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F02%3A00007807" target="_blank" >RIV/00216224:14330/02:00007807 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Limited Assignment Number Search Algorithm
Original language description
A nonsystematic iterative search algorithm for hard or over-constrained problems is proposed. This linear time complexity algorithm seeks a (partial) assignment of the problem variables. One step of the algorithm is a special incomplete version of chronological backtracking with constraint propagation. Subsequent searches try to improve the last computed partial assignment. This is done by developing variable and value heuristics based on the results of previous iterations. The algorithm was applied tosolve random problems and a large scale timetabling problem from Purdue University.
Czech name
Limited Assignment Number Search Algorithm
Czech description
A nonsystematic iterative search algorithm for hard or over-constrained problems is proposed. This linear time complexity algorithm seeks a (partial) assignment of the problem variables. One step of the algorithm is a special incomplete version of chronological backtracking with constraint propagation. Subsequent searches try to improve the last computed partial assignment. This is done by developing variable and value heuristics based on the results of previous iterations. The algorithm was applied tosolve random problems and a large scale timetabling problem from Purdue University.
Classification
Type
D - Article in proceedings
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
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)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
SOFSEM 2002 Student Research Forum
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
53
Publisher name
Neuveden
Place of publication
Milovy (CZ)
Event location
Milovy, Czech Republic
Event date
Nov 27, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—