Modularity-based decompositions for valued CSP
DOI10.1007/S10472-013-9351-0zbMATH Open1267.90121OpenAlexW2078585490MaRDI QIDQ353312FDOQ353312
Authors: Maher Helaoui, Wady Naanaa 
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
Recommendations
combinatorial problemsbinary valued CSPsmodular valuation functionsproblem decomposition schemetractable subproblem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)
Cites Work
- Soft arc consistency revisited
- Tractable triangles and cross-free convexity in discrete optimisation
- Consistency in networks of relations
- Complexity classifications of Boolean constraint satisfaction problems
- Title not available (Why is that?)
- Pseudo-Boolean optimization
- A unified theory of structural tractability for constraint satisfaction problems
- Radio link frequency assignment
- Reduction operations in fuzzy or valued constraint satisfaction
- Arc consistency for soft constraints
- High-order consistency in valued constraint satisfaction
- The Effect of Constraint Representation on Structural Tractability
- A domain decomposition algorithm for constraint satisfaction
- Title not available (Why is that?)
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
Cited In (2)
Uses Software
This page was built for publication: Modularity-based decompositions for valued CSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q353312)
