Skip to search formSkip to main contentSkip to account menu

Constraint Composite Graph

The constraint composite graph is a node-weighted undirected graph associated with a given combinatorial optimization problem posed as a weighted… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Artificial intelligenceCombinatorial optimizationComputer scienceConstraint satisfaction problem

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph
Nonlinear pseudo-Boolean optimization (nonlinear PBO) is the minimization problem on nonlinear pseudo-Boolean functions… 
2018
2018
Solving Multiagent Constraint Optimization Problems on the Constraint Composite Graph
We introduce the Constraint Composite Graph (CCG) for Distributed Constraint Optimization Problems (DCOPs), a popular paradigm… 
2018
2018
Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems
The Distributed Constraint Optimization Problem (DCOP) offers a powerful approach for the description and resolution of… 
2017
2017
A Constraint Composite Graph-Based ILP Encoding of the Boolean Weighted CSP
The weighted constraint satisfaction problem (WCSP) occurs in the crux of many real-world applications of operations research… 
2017
2017
The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP
We study two important implications of the constraint composite graph (CCG) associated with the weighted constraint satisfaction… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)