Consistency Techniques for Flow-Based Projection-Safe Global Cost Functions in Weighted Constraint Satisfaction

DOI10.1613/jair.3476zbMath1237.68188arXiv1401.4605OpenAlexW3105956889MaRDI QIDQ2887071

Ka Lun Leung, Jimmy Ho-man Lee

Publication date: 16 May 2012

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.4605

zbMATH Keywords

combinatorial problemspreferencesglobal cost functionsviolation\(\text{EDAC}^*\)weighted constraint satisfaction problems (WCSPs)

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Tractability-preserving transformations of global cost functions ⋮ Multiple-choice knapsack constraint in graphical models ⋮ New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach ⋮ Triangle-based consistencies for cost function networks ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited ⋮ Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction ⋮ Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction

This page was built for publication: Consistency Techniques for Flow-Based Projection-Safe Global Cost Functions in Weighted Constraint Satisfaction