About the choice of the variable to unassign in a decision repair algorithm

DOI10.1051/ro:2005001zbMath1102.90035OpenAlexW2136515548MaRDI QIDQ5710543

Cédric Pralet, Gérard Verfaillie

Publication date: 2 December 2005

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2005__39_1_55_0

zbMATH Keywords

heuristicscompletenesslocal searchconstraint propagationbacktrackConstraint satisfaction problemdepth first tree search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• The logic of constraint satisfaction
• Local search with constraint propagation and conflict-based heuristics
• Combining the scalability of local search with the pruning techniques of systematic search
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: About the choice of the variable to unassign in a decision repair algorithm