Constraint Composite Graph-Based Weighted CSP Solvers: An Empirical Study
The Weighted Constraint Satisfaction Problem (WCSP) is a very expressive framework for optimization problems. The Constraint Composite Graph (CCG) is a graphical representation of a given (Boolean) WCSP that facilitates its reduction to a Minimum Weighted Vertex Cover (MWVC) problem by introducing i...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
LibraryPress@UF
2024-05-01
|
| Series: | Proceedings of the International Florida Artificial Intelligence Research Society Conference |
| Online Access: | https://journals.flvc.org/FLAIRS/article/view/135606 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|