Please use this identifier to cite or link to this item:
|Title:||Search space reduction for constraint optimization problems|
|Citation:||Cheng, K.C.K.,Yap, R.H.C. (2008). Search space reduction for constraint optimization problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5202 LNCS : 635-639. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-85958-1_56|
|Abstract:||In a constraint optimization problem (COP), many feasible assignments have the same objective value. This usually means huge search space and poor propagation among the objective variables (which appear in the objective function) and the problem variables (which do not). In this paper, we investigate a search strategy that focuses on the objective function, namely, the objective variables are assigned before the problem variables. Despite the larger search space, we may indeed solve a COP faster, provided that the constraint propagation is strong - the search can reach the optimal objective value faster in the objective space, and by strong propagation it knows if the constraints are unsatisfiable with little search in the problem space. To obtain strong propagation, we study the use of dual encoding  for COPs. Our COP formulation and search strategy are general and can handle any dual COPs. © 2008 Springer-Verlag Berlin Heidelberg.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 10, 2018
checked on Nov 17, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.