Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS

DOI10.1051/ro/2013030zbMath1267.68211OpenAlexW2116625763MaRDI QIDQ4921890

Mathieu Fontaine, Samir Loudni, Patrice Boizumault

Publication date: 28 May 2013

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b4211f95257e6ff7956d9c45cc1e4aa73677f75f

zbMATH Keywords

tree decompositionconstraint propagationvariable neighborhood searchmaximum cardinality searchcost functions netwok

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Weighted heuristic anytime search: new schemes for optimization over graphical models ⋮ Variable neighborhood search for graphical model energy minimization ⋮ Exploiting Separators for Guiding VNS

This page was built for publication: Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS