Virtual pairwise consistency in cost function networks

DOI10.1007/978-3-031-33271-5_27OpenAlexW4377231152MaRDI QIDQ6080987

David Allouche, Pierre Montalbano, Simon de Givry, George Katsirelos, Tomáš Werner

Publication date: 4 October 2023

Published in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-33271-5_27

zbMATH Keywords

branch-and-bounddiscrete optimizationgraphical modeldual encodingnon-binary cost function networksoft local consistency

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• High-order consistency in valued constraint satisfaction
• Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
• Soft arc consistency revisited
• Reasoning from last conflict(s) in constraint programming
• Radio link frequency assignment
• Triangle-based consistencies for cost function networks
• Earth observation satellite management
• Bucket elimination: A unifying framework for reasoning
• Relaxation-aware heuristics for exact optimization in graphical models
• Variable neighborhood search for graphical model energy minimization
• Multi-language evaluation of exact solvers in graphical model discrete optimization
• Computational protein design as an optimization problem
• Mini-buckets
• Local Consistency in Weighted CSPs and Inference in Max-SAT
• Graphical Models, Exponential Families, and Variational Inference
• Discrete Graphical Models — An Optimization Perspective
• Graphical Models: Queries, Complexity, Algorithms
• Principles and Practice of Constraint Programming – CP 2004
• Arc consistency revisited

This page was built for publication: Virtual pairwise consistency in cost function networks