Exploiting separators for guiding VNS

DOI10.1016/J.ENDM.2012.10.035MaRDI QIDQ2840785zbMATH OpenOpenAlexFDO

Authors 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

cost function networkseparatorstree decompositionVNS hybrid

Mathematics Subject Classification ID

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

Recommendations

• Exploiting tree decomposition for guiding neighborhoods exploration for VNS
• Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
• Variable neighborhood decomposition search
• Variable neighborhood search: Principles and applications
• Variable Neighborhood Search

Cites work

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

Cited in

(2)

• scientific article; zbMATH DE number 4114676 (Why is no real title available?)
• Exploiting tree decomposition for guiding neighborhoods exploration for VNS

This page was built for publication: Exploiting separators for guiding VNS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840785)