A general variable neighborhood search for the cyclic antibandwidth problem
DOI10.1007/S10589-021-00334-YzbMATH Open1487.90617OpenAlexW4206272432MaRDI QIDQ2114825FDOQ2114825
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
Recommendations
combinatorial optimizationmetaheuristicsvariable neighborhood searchgraph layout problemcyclic antibandwidth problems
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Tabu search for the cyclic bandwidth problem
- Variable neighborhood search
- Optimal numberings and isoperimetric problems on graphs
- A survey of very large-scale neighborhood search techniques
- GRASP and path relinking for the matrix bandwidth minimization.
- A framework for solving VLSI graph layout problems
- General variable neighborhood search for the continuous optimization
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- On Some Variants of the Bandwidth Minimization Problem
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- Variable neighborhood search for the vertex separation problem
- The Cyclic Antibandwidth Problem
- On the separation number of a graph
- Multi-Start Methods
- An algorithm for reducing the bandwidth of a matrix of symmetrical configuration
- Antibandwidth and cyclic antibandwidth of Hamming graphs
- Multistart search for the cyclic cutwidth minimization problem
- Reducing the bandwidth of a sparse matrix with tabu search.
- On embeddings in cycles
- Alternative evaluation functions for the cyclic bandwidth sum problem
- Variable neighborhood search: basics and variants
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- Tabu search for min-max edge crossing in graphs
- Embedding signed graphs in the line
Cited In (4)
- Level-based heuristics and hill climbing for the antibandwidth maximization problem
- General variable neighborhood search approach to group Steiner tree problem
- Population-based iterated greedy algorithm for the S-labeling problem
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem
Uses Software
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)
