Dynamic variable ordering in graph based backjumping algorithms for csps

DOI10.1080/00207160008804975zbMATH Open0972.68788OpenAlexW2044065851MaRDI QIDQ4511615FDOQ4511615

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

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

zbMATH Keywords

constraint satisfaction problemsbacktracking algorithmgraph based backjumping

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Conflict-directed backjumping revisited
• Title not available (Why is that?)
• An enhancement scheme for constraint satisfaction problems (CSPs)

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)