Variable neighborhood search for graphical model energy minimization

DOI10.1016/j.artint.2019.103194zbMath1478.68329OpenAlexW2988046257WikidataQ126860162 ScholiaQ126860162MaRDI QIDQ2287189

Abdelkader Ouali, David Allouche, Lakhdar Loukil, Simon de Givry, Yahia Lebbah, Patrice Boizumault, Samir Loudni

Publication date: 20 January 2020

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

Full work available at URL: https://doi.org/10.1016/j.artint.2019.103194

zbMATH Keywords

combinatorial optimizationparallelismMarkov random fieldvariable neighborhood searchanytime algorithmcost function networkmost probable explanationcomplete search methodcomputational protein designdiscrete graphical model

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probabilistic graphical models (62H22)

Related Items (1)

Virtual pairwise consistency in cost function networks

Uses Software

• LibDAI
• ToulBar2
• ComputeTW
• mplp2
• GitHub
• YIELDS

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal speedup of Las Vegas algorithms
• Treewidth computations. I: Upper bounds
• Soft arc consistency revisited
• Memory intensive AND/OR search for combinatorial optimization in graphical models
• Finding MAPs for belief networks is NP-hard
• Variable neighborhood search
• Multi-language evaluation of exact solvers in graphical model discrete optimization
• Computational protein design as an optimization problem
• MPI Parallelization of Variable Neighborhood Search
• Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
• Anytime AND/OR depth-first search for combinatorial optimization
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Mini-buckets
• Graphical Models, Exponential Families, and Variational Inference
• YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
• Complexity of Finding Embeddings in a k-Tree
• Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS
• AND/OR Branch-and-Bound on a Computational Grid
• Limited discrepancy search revisited
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Variable neighborhood search for graphical model energy minimization