Combining restarts, nogoods and bag-connected decompositions for solving csps
From MaRDI portal
Publication:1706771
DOI10.1007/s10601-016-9248-8zbMath1384.90113OpenAlexW2499844773MaRDI QIDQ1706771
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal speedup of Las Vegas algorithms
- Connected tree-width
- Hybrid backtracking bounded by tree-decomposition of constraint networks
- AND/OR search spaces for graphical models
- Tree clustering for constraint networks
- Radio link frequency assignment
- Decomposing constraint satisfaction problems using database techniques
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- A comparison of structural CSP decomposition methods
- On forward checking for non-binary constraint satisfaction.
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Bridging constraint satisfaction and Boolean satisfiability
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Dynamic Management of Heuristics for Solving Structured CSPs
- Connected Treewidth and Connected Graph Searching
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- A Sufficient Condition for Backtrack-Free Search
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Bounding Connected Tree-Width
- Principles and Practice of Constraint Programming – CP 2004
- Topological parameters for time-space tradeoff
