Tabu search for the cyclic bandwidth problem
DOI10.1016/J.COR.2014.11.013zbMATH Open1348.90604OpenAlexW1994102978MaRDI QIDQ337475FDOQ337475
Authors: Eduardo Rodriguez-Tello, Hillel Romero-Monsivais, Gabriel Ramirez-Torres, 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
Recommendations
- Alternative evaluation functions for the cyclic bandwidth sum problem
- A general variable neighborhood search for the cyclic antibandwidth problem
- Tabu search algorithms for cyclic machine scheduling problems
- scientific article; zbMATH DE number 719423
- Tabu search and iterated local search for the cyclic bottleneck assignment problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Communication networks in operations research (90B18)
Cites Work
- Title not available (Why is that?)
- Metaheuristics. From design to implementation.
- An efficient memetic algorithm for the graph partitioning problem
- Title not available (Why is that?)
- Handbook of combinatorial optimization. In 5 volumes
- Optimal Assignments of Numbers to Vertices
- Adaptive tabu search for course timetabling
- A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
- Bounding the bandwidths for graphs
- A memetic algorithm for graph coloring
- GRASP and path relinking for the matrix bandwidth minimization.
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- A framework for solving VLSI graph layout problems
- Variable neighbourhood search for bandwidth reduction
- GRASP with path relinking heuristics for the antibandwidth problem
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- Optimal labelling of a product of two paths
- Bandwidth of the complete \(k\)-ary tree
- Optimal labelling of unit interval graphs
- 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
- The Analysis of Large Structural Systems
- On Some Variants of the Bandwidth Minimization Problem
- Memetic search for the max-bisection problem
- The Cyclic Antibandwidth Problem
- Antibandwidth of Complete k-Ary Trees
- Antibandwidth of Three-Dimensional Meshes
- Title not available (Why is that?)
- On the separation number of a graph
- Bounds on the costs of data encodings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On semidefinite programming bounds for graph bandwidth
- Characterization of graphs with equal bandwidth and cyclic bandwidth
- Memetic algorithm for the antibandwidth maximization problem
Cited In (6)
- Lower bounds for the bandwidth problem
- Algorithmic expedients for the \(S\)-labeling problem
- A general variable neighborhood search for the cyclic antibandwidth problem
- Population-based iterated greedy algorithm for the S-labeling problem
- TScb
- A note on computational approaches for the antibandwidth problem
Uses Software
This page was built for publication: Tabu search for the cyclic bandwidth problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337475)
