VEŘMIŘOVSKÝ, Kamil and Hana RUDOVÁ. Limited Assignment Number Search Algorithm. In SOFSEM 2002 Student Research Forum. Milovy (CZ): Neuveden, 2002, p. 53-58.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Limited Assignment Number Search Algorithm
Authors VEŘMIŘOVSKÝ, Kamil (203 Czech Republic) and Hana RUDOVÁ (203 Czech Republic, guarantor).
Edition Milovy (CZ), SOFSEM 2002 Student Research Forum, p. 53-58, 2002.
Publisher Neuveden
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 20200 2.2 Electrical engineering, Electronic engineering, Information engineering
Country of publisher Czech Republic
Confidentiality degree is not subject to a state or trade secret
WWW PDF
RIV identification code RIV/00216224:14330/02:00007807
Organization unit Faculty of Informatics
Keywords in English search algorithm; constraint satisfaction; constraint logic programming
Tags constraint logic programming, constraint satisfaction, search algorithm
Changed by Changed by: doc. Mgr. Hana Rudová, Ph.D., učo 3840. Changed: 21/5/2003 21:31.
Abstract
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 to solve random problems and a large scale timetabling problem from Purdue University.
Links
GA201/01/0942, research and development projectName: Pokročilé plánování a rozvrhování
Investor: Czech Science Foundation, Advanced Planning and Scheduling
PrintDisplayed: 25/8/2024 00:16