Revision as of 10:08, 15 September 2021 edit Sdegivry (talk \| contribs) 8 edits No edit summary ← Previous edit		Revision as of 10:10, 15 September 2021 edit undo Sdegivry (talk \| contribs) 8 edits mNo edit summary Next edit →
Line 13: Considering a WCN/CFN, the usual (NP-hard) task of WCSP is to find a complete instantiation with a minimal cost. ~~Oher~~Other tasks in the related field of [[graphical model]] can be defined.<ref>M Cooper, S de Givry, and T Schiex. Graphical models: Queries, complexity, algorithms (tutorial). In 37th International Symposium on Theoretical Aspects of Computer Science (STACS-20), volume 154 of LIPIcs, pages 4:1-4:22, Montpellier, France, 2020.</ref> ==Resolution of binary/ternary WCSPs==

Weighted constraint satisfaction problem: Difference between revisions