Multi-language evaluation of exact solvers in graphical model discrete optimization
From MaRDI portal
Publication:2398440
DOI10.1007/s10601-016-9245-yzbMath1368.90107OpenAlexW2342178758MaRDI QIDQ2398440
Barry O'Sullivan, Simon de Givry, Matthias Zytnicki, George Katsirelos, Thomas Schiex, Barry Hurley, David Allouche
Publication date: 16 August 2017
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-016-9245-y
integer linear programmingMarkov random fieldgraphical modelMaxSATweighted constraint satisfaction problem
Related Items
Tractability-preserving transformations of global cost functions ⋮ Multiple-choice knapsack constraint in graphical models ⋮ Virtual pairwise consistency in cost function networks ⋮ Triangle-based consistencies for cost function networks ⋮ The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP ⋮ Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains ⋮ Variable neighborhood search for graphical model energy minimization ⋮ MiniBrass: soft constraints for MiniZinc
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MaxSAT by improved instance-specific algorithm configuration
- Tractability-preserving transformations of global cost functions
- Arc consistency for soft constraints
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- Soft arc consistency revisited
- Radio link frequency assignment
- Earth observation satellite management
- Bucket elimination: A unifying framework for reasoning
- A logical approach to efficient Max-SAT solving
- Computational protein design as an optimization problem
- Solving the simple plant location problem by genetic algorithm
- Modelling Max-CSP as Partial Max-SAT
- GAC Via Unit Propagation
- 50 Years of Integer Programming 1958-2008
- Exploiting the Power of mip Solvers in maxsat
- Principles and Practice of Constraint Programming – CP 2004
- Algorithm portfolios
