Dynamic variable ordering in graph based backjumping algorithms for csps

DOI10.1080/00207160008804975MaRDI QIDQ4511615zbMATH OpenOpenAlexFDO

Authors

Publication date 30 October 2000

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160008804975

zbMATH Keywords

constraint satisfaction problemsbacktracking algorithmgraph based backjumping

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) General topics in artificial intelligence (68T01)

Recommendations

• scientific article; zbMATH DE number 2084732
• Conflict-directed backjumping revisited
• Backjump-based backtracking for constraint satisfaction problems
• A theoretical evaluation of selected backtracking algorithms.
• Using an incomplete version of dynamic backtracking for graph colouring

Cites work

• A Sufficient Condition for Backtrack-Free Search
• Backtrack programming techniques
• Estimating the Efficiency of Backtrack Programs
• Network-based heuristics for constraint-satisfaction problems
• Networks of constraints: Fundamental properties and applications to picture processing
• Reduction operations for constraint satisfaction
• Tree clustering for constraint networks

Cited in

(3)

• An enhancement scheme for constraint satisfaction problems (CSPs)
• scientific article; zbMATH DE number 4162307 (Why is no real title available?)
• Conflict-directed backjumping revisited

This page was built for publication: Dynamic variable ordering in graph based backjumping algorithms for csps

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