Memetic algorithm for the antibandwidth maximization problem

DOI10.1007/s10732-010-9124-4zbMath1205.90285OpenAlexW2020148023MaRDI QIDQ623314

Richa Bansal, Kamal Srivastava

Publication date: 14 February 2011

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-010-9124-4

zbMATH Keywords

breadth first searchmemetic algorithmsantibandwidth

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Approximation methods and heuristics in mathematical programming (90C59) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (6)

Tabu search for the cyclic bandwidth problem ⋮ The maximum \(k\)-differential coloring problem ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ Antibandwidth and cyclic antibandwidth of Hamming graphs ⋮ A note on maximum differential coloring of planar graphs ⋮ A note on computational approaches for the antibandwidth problem

Uses Software

• GDToolkit

Cites Work

• Unnamed Item
• Unnamed Item
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• On explicit formulas for bandwidth and antibandwidth of hypercubes
• Hamiltonian powers in threshold and arborescent comparability graphs
• The Obnoxious Center Problem on a Tree
• Antibandwidth and Cyclic Antibandwidth of Hamming Graphs
• On Some Variants of the Bandwidth Minimization Problem
• Antibandwidth of Complete k-Ary Trees
• Antibandwidth of Three-Dimensional Meshes
• On the separation number of a graph
• Powers of Hamiltonian paths in interval graphs

This page was built for publication: Memetic algorithm for the antibandwidth maximization problem