%0 Journal Article
	%A Abdolreza Hatamlou and  Yusef Farhang and  Mohammad Reza Meybodi
	%D 2009
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 26, 2009
	%T Combining Variable Ordering Heuristics for Improving Search Algorithms Performance
	%U https://publications.waset.org/pdf/2235
	%V 26
	%X Variable ordering heuristics are used in constraint satisfaction algorithms. Different characteristics of various variable ordering heuristics are complementary. Therefore we have tried to get the advantages of all heuristics to improve search algorithms performance for solving constraint satisfaction problems. This paper considers combinations based on products and quotients, and then a newer form of combination based on weighted sums of ratings from a set of base heuristics, some of which result in definite improvements in performance.

	%P 427 - 429