Neighborhood-based variable ordering heuristics for the constraint satisfaction problem

DOI10.1007/3-540-45578-7_40MaRDI QIDQ4475662zbMATH OpenFDO

Authors Christian Bessiere, Assef Chmeiss, Lakhdar Sais

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390565.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Variable neighborhood search for the linear ordering problem
• A non-binary constraint ordering heuristic for constraint satisfaction problems
• Variable ordering for efficient SAT search by analyzing constraint-variable dependencies
• A generalized variable neighborhood search for combinatorial optimization problems
• General variable neighborhood search for the order batching and sequencing problem
• Variable neighborhood search strategies for the order batching problem

Cited in

(7)

• A non-binary constraint ordering heuristic for constraint satisfaction problems
• Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
• An empirical study of probabilistic arc consistency as a variable ordering heuristic
• Dynamic variable ordering in graph based backjumping algorithms for csps
• Learning cluster-based structure to solve constraint satisfaction problems
• Identifying and exploiting problem structures using explanation-based constraint programming
• Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination

This page was built for publication: Neighborhood-based variable ordering heuristics for the constraint satisfaction problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4475662)