Exploiting Separators for Guiding VNS

DOI10.1016/j.endm.2012.10.035zbMath1268.68152OpenAlexW2047839824MaRDI QIDQ2840785

Samir Loudni, Mathieu Fontaine, Patrice Boizumault

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.035

zbMATH Keywords

tree decompositionseparatorscost function networkVNS hybrid

Mathematics Subject Classification ID

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

Cites Work

• Combining VNS with constraint programming for solving anytime optimization problems
• Tree clustering for constraint networks
• Variable neighborhood decomposition search
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Graph minors. II. Algorithmic aspects of tree-width
• Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS

This page was built for publication: Exploiting Separators for Guiding VNS