Modularity-based decompositions for valued CSP

DOI10.1007/s10472-013-9351-0zbMath1267.90121OpenAlexW2078585490MaRDI QIDQ353312

Wady Naanaa, Maher Helaoui

Publication date: 12 July 2013

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-013-9351-0

zbMATH Keywords

combinatorial problemsbinary valued CSPsmodular valuation functionsproblem decomposition schemetractable subproblem

Mathematics Subject Classification ID

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

Uses Software

• ToulBar2

Cites Work

• Unnamed Item
• Unnamed Item
• Pseudo-Boolean optimization
• Arc consistency for soft constraints
• High-order consistency in valued constraint satisfaction
• A unified theory of structural tractability for constraint satisfaction problems
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
• Soft arc consistency revisited
• Consistency in networks of relations
• Radio link frequency assignment
• Reduction operations in fuzzy or valued constraint satisfaction
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• Tractable Triangles and Cross-Free Convexity in Discrete Optimisation
• The Effect of Constraint Representation on Structural Tractability
• A domain decomposition algorithm for constraint satisfaction

This page was built for publication: Modularity-based decompositions for valued CSP