A note on computational approaches for the antibandwidth problem
From MaRDI portal
Publication:2051212
DOI10.1007/s10100-020-00688-4OpenAlexW3032903144MaRDI QIDQ2051212
Publication date: 24 November 2021
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.03367
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tabu search for the cyclic bandwidth problem
- Branch and bound for the cutwidth minimization problem
- A note on maximum differential coloring of planar graphs
- Memetic algorithm for the antibandwidth maximization problem
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- On explicit formulas for bandwidth and antibandwidth of hypercubes
- Antibandwidth of complete \(k\)-ary trees
- Algorithmic expedients for the \(S\)-labeling problem
- A branch and bound algorithm for the maximum diversity problem
- Antibandwidth and cyclic antibandwidth of Hamming graphs
- A cutting plane algorithm for graph coloring
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- A survey of local search methods for graph coloring
- A branch-and-cut algorithm for graph coloring
- Laying Out Sparse Graphs with Provably Minimum Bandwidth
- Decorous Lower Bounds for Minimum Linear Arrangement
- A survey on vertex coloring problems
- GRASP with path relinking heuristics for the antibandwidth problem
- On Some Variants of the Bandwidth Minimization Problem
- On the separation number of a graph
- A graph coloring algorithm for large scheduling problems
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Level-based heuristics and hill climbing for the antibandwidth maximization problem
This page was built for publication: A note on computational approaches for the antibandwidth problem
