Relaxation-aware heuristics for exact optimization in graphical models
From MaRDI portal
Publication:2110439
DOI10.1007/978-3-030-58942-4_31MaRDI 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
branch-and-bound; linear relaxation; graphical model; cost function network; weighted constraint satisfaction problem; local polytope; variable ordering heuristic; virtual arc consistency
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
90Bxx: Operations research and management science
Related Items
Boosting branch-and-bound MaxSAT solvers with clause learning, Virtual pairwise consistency in cost function networks, Multiple-choice knapsack constraint in graphical models