Solution counting algorithms for constraint-centered search heuristics

Author： Zanarini Alessandro Pesant Gilles

ISSN： 1383-7133

Source： Constraints, Vol.14, Iss.3, 2009-09, pp. : 392-413

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Searching the Solution Space in Constructive Geometric Constraint Solving with Genetic Algorithms

By Luzón M. Soto A. Gálvez J. Joan-Arinyo R.

Applied Intelligence, Vol. 22, Iss. 2, 2005-03 ,pp. : 109-124

Springer Publishing Company

Access to resources Recommend Favorite

On matrices, automata, and double counting in constraint programming

By Beldiceanu Nicolas

Constraints, Vol. 18, Iss. 1, 2013-01 ,pp. : 108-140

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for Distributed Constraint Satisfaction: A Review

By Yokoo M.

Autonomous Agents and Multi-Agent Systems, Vol. 3, Iss. 2, 2000-06 ,pp. : 185-207

Springer Publishing Company

Access to resources Recommend Favorite

Direct Solution of Fuzzy Project Crashing Problem with Fuzzy Decision Variables using Tabu Search and Simulated Annealing Algorithms

International Journal of Fuzzy System Applications (IJFSA), Vol. 6, Iss. 1, 2017-01 ,pp. : 17-35

IGI Global_journal

Access to resources Recommend Favorite

Special issue on hyper-heuristics in search and optimization

By Ochoa Gabriela

Journal of Heuristics, Vol. 16, Iss. 6, 2010-12 ,pp. : 745-748

Springer Publishing Company

Access to resources Recommend Favorite