Multistart search for the cyclic cutwidth minimization problem

DOI10.1016/j.cor.2020.105116OpenAlexW3092789007MaRDI QIDQ2026984

Sergio Cavero, Abraham Duarte, Manuel Laguna, Eduardo G. Pardo

Publication date: 21 May 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105116

zbMATH Keywords

Tabu searchcircular embeddinggraph layout problemcyclic cutwidthmultistart search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Lower bounds for the bandwidth problem, Efficient iterated greedy for the two-dimensional bandwidth minimization problem, Population-based iterated greedy algorithm for the S-labeling problem, A general variable neighborhood search for the cyclic antibandwidth problem

Uses Software

• Harwell-Boeing sparse matrix collection
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Branch and bound for the cutwidth minimization problem
• A branch-and-bound algorithm for the single-row equidistant facility layout problem
• On minimizing width in linear layouts
• GRASP and path relinking for the max-min diversity problem
• The cyclic cutwidth of trees
• GRASP and path relinking for the matrix bandwidth minimization.
• Scatter search for the cutwidth minimization problem
• Future paths for integer programming and links to artificial intelligence
• Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes
• First vs. best improvement: an empirical study
• On Bipartite Drawings and the Linear Arrangement Problem
• Tabu Search—Part I
• Tabu Search—Part II
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Parallel variable neighbourhood search strategies for the cutwidth minimization problem
• Cutwidth II: Algorithms for partial w-trees of bounded degree
• Hamiltonian Circuits and Paths on the n-Cube
• Optimal numberings and isoperimetric problems on graphs