New relationships for multi-neighborhood search for the minimum linear arrangement problem

DOI10.1016/j.jda.2017.10.003zbMath1374.68500OpenAlexW2762782594MaRDI QIDQ1679609

Fred Glover, César Rego

Publication date: 9 November 2017

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2017.10.003

zbMATH Keywords

metaheuristicsmulti-neighborhood searchexponential neighborhoodsminimum linear arrangementcombinatorial leverage

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal linear labelings and eigenvalues of graphs
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
• Optimal Linear Ordering
• Experiments on the minimum linear arrangement problem
• Graph minimum linear arrangement by multilevel weighted edge contractions
• Optimal Assignments of Numbers to Vertices

This page was built for publication: New relationships for multi-neighborhood search for the minimum linear arrangement problem