Tabu search for the cyclic bandwidth problem
From MaRDI portal
Publication:337475
DOI10.1016/j.cor.2014.11.013zbMath1348.90604OpenAlexW1994102978MaRDI QIDQ337475
Gabriel Ramirez-Torres, Hillel Romero-Monsivais, Eduardo Rodriguez-Tello, Frédéric Lardeux
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.11.013
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Lower bounds for the bandwidth problem ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ Algorithmic expedients for the \(S\)-labeling problem ⋮ A note on computational approaches for the antibandwidth problem ⋮ TScb ⋮ A general variable neighborhood search for the cyclic antibandwidth problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Memetic search for the max-bisection problem
- Memetic algorithm for the antibandwidth maximization problem
- An efficient memetic algorithm for the graph partitioning problem
- A framework for solving VLSI graph layout problems
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- A memetic algorithm for graph coloring
- Optimal labelling of a product of two paths
- GRASP and path relinking for the matrix bandwidth minimization.
- Bounding the bandwidths for graphs
- Bandwidth of the complete \(k\)-ary tree
- Optimal labelling of unit interval graphs
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- Variable neighbourhood search for bandwidth reduction
- Adaptive tabu search for course timetabling
- Particle swarm optimization and hill climbing for the bandwidth minimization problem
- A branch and bound algorithm for the matrix bandwidth minimization
- An improved simulated annealing algorithm for bandwidth minimization
- Antibandwidth and Cyclic Antibandwidth of Hamming Graphs
- GRASP with path relinking heuristics for the antibandwidth problem
- The Analysis of Large Structural Systems
- On Some Variants of the Bandwidth Minimization Problem
- The Cyclic Antibandwidth Problem
- Antibandwidth of Complete k-Ary Trees
- Antibandwidth of Three-Dimensional Meshes
- A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
- On the separation number of a graph
- Bounds on the costs of data encodings
- Handbook of Combinatorial Optimization
- On semidefinite programming bounds for graph bandwidth
- Optimal Assignments of Numbers to Vertices
- Characterization of graphs with equal bandwidth and cyclic bandwidth
This page was built for publication: Tabu search for the cyclic bandwidth problem
