Tabu search for the cyclic bandwidth problem

DOI10.1016/J.COR.2014.11.013MaRDI QIDQ337475zbMATHOpenAlexFDO

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

zbMATH Keywords

tabu searchbest-known boundscyclic bandwidth problem

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 5640406 (Why is no real title available?)
• scientific article; zbMATH DE number 4070955 (Why is no real title available?)
• scientific article; zbMATH DE number 719423 (Why is no real title available?)
• scientific article; zbMATH DE number 1045605 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 2016615 (Why is no real title available?)
• A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
• A branch and bound algorithm for the matrix bandwidth minimization
• A framework for solving VLSI graph layout problems
• A memetic algorithm for graph coloring
• Adaptive tabu search for course timetabling
• An efficient memetic algorithm for the graph partitioning problem
• An improved simulated annealing algorithm for bandwidth minimization
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Antibandwidth of Complete k-Ary Trees
• Antibandwidth of Three-Dimensional Meshes
• Bandwidth of the complete \(k\)-ary tree
• Bounding the bandwidths for graphs
• Bounds on the costs of data encodings
• Characterization of graphs with equal bandwidth and cyclic bandwidth
• GRASP and path relinking for the matrix bandwidth minimization.
• GRASP with path relinking heuristics for the antibandwidth problem
• Handbook of combinatorial optimization. In 5 volumes
• Memetic algorithm for the antibandwidth maximization problem
• Memetic search for the max-bisection problem
• Metaheuristics. From design to implementation.
• On Some Variants of the Bandwidth Minimization Problem
• On semidefinite programming bounds for graph bandwidth
• On the separation number of a graph
• Optimal Assignments of Numbers to Vertices
• Optimal labelling of a product of two paths
• Optimal labelling of unit interval graphs
• Particle swarm optimization and hill climbing for the bandwidth minimization problem
• Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
• The Analysis of Large Structural Systems
• The Cyclic Antibandwidth Problem
• Variable neighbourhood search for bandwidth reduction

Cited in

(7)

• Population-based iterated greedy algorithm for the S-labeling problem
• Algorithmic expedients for the \(S\)-labeling problem
• A general variable neighborhood search for the cyclic antibandwidth problem
• Alternative evaluation functions for the cyclic bandwidth sum problem
• A note on computational approaches for the antibandwidth problem
• Lower bounds for the bandwidth problem
• TScb

Describes a project that uses

Uses Software

• Tabu search
• AETG
• SAcb

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)