GRASP with path relinking heuristics for the antibandwidth problem
From MaRDI portal
Publication:3100697
DOI10.1002/NET.20418zbMATH Open1229.90095OpenAlexW2064388010MaRDI QIDQ3100697FDOQ3100697
Authors: Abraham Duarte, Rafael Martí, Ricardo Silva, 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
Recommendations
- Memetic algorithm for the antibandwidth maximization problem
- GRASP and path relinking for the matrix bandwidth minimization.
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- Level-based heuristics and hill climbing for the antibandwidth maximization problem
- Antibandwidth and cyclic antibandwidth of Hamming graphs
Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Integer programming (90C10)
Cites Work
- Mersenne twister
- A hybrid heuristic for the \(p\)-median problem
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A probabilistic heuristic for a computationally difficult set covering problem
- The NP-completeness of the bandwidth minimization problem
- Scatter search. Methodology and implementation in C. With CD-ROM.
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- GRASP and path relinking for the matrix bandwidth minimization.
- GRASP and path relinking for the max-min diversity problem
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- 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
- Title not available (Why is that?)
- Hamiltonian powers in threshold and arborescent comparability graphs
- Reducing the bandwidth of a sparse matrix with tabu search.
- Title not available (Why is that?)
Cited In (18)
- Algorithmic expedients for the \(S\)-labeling problem
- Level-based heuristics and hill climbing for the antibandwidth maximization problem
- Experimental and Efficient Algorithms
- Population-based iterated greedy algorithm for the S-labeling problem
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
- A note on maximum differential coloring of planar graphs
- The maximum \(k\)-differential coloring 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
- Variable neighborhood search for the vertex separation problem
- Tabu search for the cyclic bandwidth problem
- The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
- A note on computational approaches for the antibandwidth problem
- GRASP and path relinking for the matrix bandwidth minimization.
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
- Restart strategies for GRASP with path-relinking heuristics
- Multiobjective GRASP with path relinking
Uses Software
This page was built for publication: GRASP with path relinking heuristics for the antibandwidth problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100697)
