Relaxation-aware heuristics for exact optimization in graphical models

DOI10.1007/978-3-030-58942-4_31OpenAlexW3090472451MaRDI QIDQ2110439

Simon de Givry, George Katsirelos, Fulya Trösser

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-58942-4_31

zbMATH Keywords

branch-and-boundlinear relaxationgraphical modelcost function networkweighted constraint satisfaction problemlocal polytopevariable ordering heuristicvirtual arc 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)

Related Items (3)

Multiple-choice knapsack constraint in graphical models ⋮ Virtual pairwise consistency in cost function networks ⋮ Boosting branch-and-bound MaxSAT solvers with clause learning

This page was built for publication: Relaxation-aware heuristics for exact optimization in graphical models