GRASP with path relinking heuristics for the antibandwidth problem

DOI10.1002/net.20418zbMath1229.90095OpenAlexW2064388010MaRDI QIDQ3100697

Ricardo M. A. Silva, Abraham Duarte, Rafael Martí, Mauricio G. C. Resende

Publication date: 21 November 2011

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20418

zbMATH Keywords

bandwidthmetaheuristicsGRASPpath-relinkingevolutionary path-relinkingantibandwidth

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Multiobjective GRASP with path relinking, Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem, A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem, Combining intensification and diversification strategies in VNS. An application to the vertex separation problem, Tabu search for the cyclic bandwidth problem, Variable neighborhood search for the vertex separation problem, The maximum \(k\)-differential coloring problem, Multi-objective variable neighborhood search: an application to combinatorial optimization problems, The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions, Population-based iterated greedy algorithm for the S-labeling problem, A note on maximum differential coloring of planar graphs, Restart strategies for GRASP with path-relinking heuristics, Algorithmic expedients for the \(S\)-labeling problem, \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms, A note on computational approaches for the antibandwidth problem, Level-based heuristics and hill climbing for the antibandwidth maximization problem

Uses Software

• Scatter Search
• MersenneTwister

Cites Work

• Unnamed Item
• Unnamed Item
• GRASP and path relinking for the max-min diversity problem
• A probabilistic heuristic for a computationally difficult set covering problem
• The NP-completeness of the bandwidth minimization problem
• Hamiltonian powers in threshold and arborescent comparability graphs
• GRASP and path relinking for the matrix bandwidth minimization.
• A hybrid heuristic for the \(p\)-median problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• An improved simulated annealing algorithm for bandwidth minimization
• Antibandwidth and Cyclic Antibandwidth of Hamming Graphs
• On Some Variants of the Bandwidth Minimization Problem
• Antibandwidth of Three-Dimensional Meshes
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• Mersenne twister
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Reducing the bandwidth of a sparse matrix with tabu search.