. Boussemart, ColorSeg-8, InPainting-4, InPainting-8, ProteinInteraction, and CFN CELAR, ProteinDesign, SPOT5, Warehouse categories. 9 Weighted degree heuristic, 2004.

R. Alford, 3 stopping after 100, 000 iterations or 10 ?5 gap thres. References [Alford and others, Electronic Notes in Discrete Mathematics, vol.212, pp.263-272, 2004.

R. Dechter, I. Dechter, ;. Rish, and . Favier, Exploiting tree decomposition for guiding neighborhoods exploration for VNS. RAIRO OR, Proc. of IJCAI, vol.50, pp.169-174, 1995.

, A comparative study of modern inference techniques for structured discrete energy minimization problems, Probabilistic graphical models: principles and techniques, vol.115, pp.155-184, 2009.

;. Kolmogorov and . Kolmogorov, Convergent Tree-Reweighted Message Passing for Energy Minimization, 2006.

. Ieee-t, . Patt, and . Larrosa, Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks, Handbook of Constraint Programming, vol.28, pp.1097-1100, 1993.

M. Joris, . Mooij, and . Neveu, libDAI: A free and open source C++ library for discrete approximate inference in graphical models, Proc. of CP, vol.11, p.84, 2004.

[. Otten, Using constraint programming and local search methods to solve vehicle routing problems, NIPS W. DISCML, vol.47, pp.503-510, 1994.

. Sontag, Subproblemtree calibration: A unified approach to max-product message passing, Machine Learning, vol.1, pp.190-198, 2008.