A general variable neighborhood search for the cyclic antibandwidth problem

DOI10.1007/S10589-021-00334-YMaRDI QIDQ2114825zbMATH OpenOpenAlexFDO

Authors Sergio Cavero, Eduardo G. Pardo, Abraham Duarte

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)

Recommendations

• The Cyclic Antibandwidth Problem
• Tabu search for the cyclic bandwidth problem
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Multistart search for the cyclic cutwidth minimization problem
• Memetic algorithm for the antibandwidth maximization problem

Cites work

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

Cited in

(7)

• Multi-armed bandit for the cyclic minimum sitting arrangement problem
• Level-based heuristics and hill climbing for the antibandwidth maximization problem
• General variable neighborhood search approach to group Steiner tree problem
• Alternative evaluation functions for the cyclic bandwidth sum problem
• Population-based iterated greedy algorithm for the S-labeling problem
• Tabu search for the cyclic bandwidth problem
• Efficient iterated greedy for the two-dimensional bandwidth minimization problem

Describes a project that uses

Uses Software

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

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

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