A general variable neighborhood search for the cyclic antibandwidth problem

DOI10.1007/s10589-021-00334-yzbMath1487.90617OpenAlexW4206272432MaRDI QIDQ2114825

Abraham Duarte, Eduardo G. Pardo, Sergio Cavero

Publication date: 15 March 2022

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-021-00334-y

zbMATH Keywords

combinatorial optimizationmetaheuristicsvariable neighborhood searchgraph layout problemcyclic antibandwidth problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

General variable neighborhood search approach to group Steiner tree problem ⋮ Efficient iterated greedy for the two-dimensional bandwidth minimization problem ⋮ Population-based iterated greedy algorithm for the S-labeling problem

Uses Software

• GLOB
• irace
• Harwell-Boeing sparse matrix collection
• Tabu search
• TScb
• SAcb

Cites Work

• Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
• Tabu search for the cyclic bandwidth problem
• Variable neighborhood search for the vertex separation problem
• A survey of very large-scale neighborhood search techniques
• A framework for solving VLSI graph layout problems
• General variable neighborhood search for the continuous optimization
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Variable neighborhood search
• GRASP and path relinking for the matrix bandwidth minimization.
• Alternative evaluation functions for the cyclic bandwidth sum problem
• Variable neighborhood search: basics and variants
• On embeddings in cycles
• Multistart search for the cyclic cutwidth minimization problem
• Embedding signed graphs in the line
• Tabu search for min-max edge crossing in graphs
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• On Some Variants of the Bandwidth Minimization Problem
• The Cyclic Antibandwidth Problem
• On the separation number of a graph
• Multi-Start Methods
• Parallel variable neighbourhood search strategies for the cutwidth minimization problem
• An algorithm for reducing the bandwidth of a matrix of symmetrical configuration
• Optimal numberings and isoperimetric problems on graphs
• Reducing the bandwidth of a sparse matrix with tabu search.

This page was built for publication: A general variable neighborhood search for the cyclic antibandwidth problem