scientific article; zbMATH DE number 2080311

MaRDI QIDQ4473030zbMATH OpenFDO

Authors Narendra Jussien, R. Debruyne, Patrice Boizumault

Publication date 4 August 2004

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

Mathematics Subject Classification ID

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

Recommendations

• Conflict-directed backjumping revisited
• Saving support-checks does not always save time
• Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost
• A theoretical evaluation of selected backtracking algorithms.
• scientific article; zbMATH DE number 1149402

Cited in

(16)

• Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem
• Asynchronous aggregation and consistency in distributed constraint satisfaction
• Saving support-checks does not always save time
• Local search with constraint propagation and conflict-based heuristics
• A hybrid constraint programming/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem
• Explanation-based large neighborhood search
• A CSP search algorithm with responsibility sets and kernels
• Explaining the \texttt{cumulative} propagator
• Reasoning from last conflict(s) in constraint programming
• Conflict-directed backjumping revisited
• Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost
• Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
• Principles and Practice of Constraint Programming – CP 2004
• Identifying and exploiting problem structures using explanation-based constraint programming
• Constraint solving in uncertain and dynamic environments: A survey
• MUST: Provide a Finer-Grained Explanation of Unsatisfiability

This page was built for publication:

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