Modularity-based decompositions for valued CSP
type: Item
instance of: scholarly article
title: Modularity-based decompositions for valued CSP
zbMATH Open document ID: 1267.90121
author: Maher Helaoui
author: Wady Naanaa
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2013-07-12T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6187491
zbMATH Keywords: combinatorial problems
zbMATH Keywords: binary valued CSPs
zbMATH Keywords: modular valuation functions
zbMATH Keywords: problem decomposition scheme
zbMATH Keywords: tractable subproblem
describes a project that uses: ToulBar2
MaRDI profile type: Publication
full work available at URL: s10472-013-9351-0
OpenAlex ID: W2078585490
cites work: Soft arc consistency revisited
cites work: Tractable triangles and cross-free convexity in discrete optimisation
cites work: Pseudo-Boolean optimization
cites work: Radio link frequency assignment
cites work: Q5715675
cites work: Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
cites work: A unified theory of structural tractability for constraint satisfaction problems
cites work: Reduction operations in fuzzy or valued constraint satisfaction
cites work: Arc consistency for soft constraints
cites work: High-order consistency in valued constraint satisfaction
cites work: Complexity classifications of Boolean constraint satisfaction problems
cites work: Consistency in networks of relations
cites work: The Effect of Constraint Representation on Structural Tractability
cites work: Q4857375
cites work: A domain decomposition algorithm for constraint satisfaction
DOI: 10.1007/S10472-013-9351-0
description: scientific article; zbMATH DE number 6187491