Combining restarts, nogoods and bag-connected decompositions for solving csps

DOI10.1007/S10601-016-9248-8MaRDI QIDQ1706771zbMATH OpenOpenAlexFDO

Authors Philippe Jégou, Cyril Terrioux

Publication date 28 March 2018

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://hal-amu.archives-ouvertes.fr/hal-01479532/file/Constraints-2017-Jegou.pdf

zbMATH Keywords

tree-decompositionconstraint satisfaction problemsrestartbag-connected tree-decomposition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Combining restarts, nogoods and decompositions for solving CSPs
• Tree decomposition method combined with separator in constraint satisfaction problems
• A comparison of structural CSP decomposition methods
• Recent Advances in Constraints
• Hybrid backtracking bounded by tree-decomposition of constraint networks

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• A Sufficient Condition for Backtrack-Free Search
• A comparison of structural CSP decomposition methods
• AND/OR search spaces for graphical models
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Bounding connected tree-width
• Bridging constraint satisfaction and Boolean satisfiability
• Combining restarts, nogoods and decompositions for solving CSPs
• Complexity of Finding Embeddings in a k-Tree
• Connected Treewidth and Connected Graph Searching
• Connected tree-width
• Decomposing constraint satisfaction problems using database techniques
• Dynamic Management of Heuristics for Solving Structured CSPs
• Graph minors. II. Algorithmic aspects of tree-width
• Handbook of constraint programming.
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Hybrid backtracking bounded by tree-decomposition of constraint networks
• On forward checking for non-binary constraint satisfaction.
• Optimal speedup of Las Vegas algorithms
• Principles and Practice of Constraint Programming – CP 2004
• Radio link frequency assignment
• Recording and minimizing nogoods from restarts
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Topological parameters for time-space tradeoff
• Tree clustering for constraint networks

Cited in

(4)

• Hybrid backtracking bounded by tree-decomposition of constraint networks
• Combining restarts, nogoods and decompositions for solving CSPs
• Tree decomposition method combined with separator in constraint satisfaction problems
• Recording and minimizing nogoods from restarts

Describes a project that uses

Uses Software

• ToulBar2

This page was built for publication: Combining restarts, nogoods and bag-connected decompositions for solving csps

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