A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs

DOI10.1016/j.ins.2014.12.041zbMath1360.05170OpenAlexW2040534084MaRDI QIDQ528766

Jose Torres-Jimenez, Alberto Garcia-Robledo, Raghu N. Kacker, Aldo Gonzalez-Gomez, Idelfonso Izquierdo-Marquez, Javier Bernal

Publication date: 16 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.12.041

zbMATH Keywords

combinatorial optimizationsimulated annealingmeta-heuristicbandwidth minimization

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Metaheuristic algorithms for the bandwidth reduction of large-scale matrices ⋮ A variable neighborhood search and simulated annealing hybrid for the profile minimization problem ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ A constructive bandwidth reduction algorithm -- a variant of GPS algorithm ⋮ Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ An evaluation of low-cost heuristics for matrix bandwidth and profile reductions

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive memory programming for matrix bandwidth minimization
• A framework for solving VLSI graph layout problems
• Heuristics for matrix bandwidth reduction
• The NP-completeness of the bandwidth minimization problem
• Finding exact solutions to the bandwidth minimization problem
• GRASP and path relinking for the matrix bandwidth minimization.
• Variable neighbourhood search for bandwidth reduction
• A branch and bound algorithm for the matrix bandwidth minimization
• An improved simulated annealing algorithm for bandwidth minimization
• Laying Out Sparse Graphs with Provably Minimum Bandwidth
• Even Faster Exact Bandwidth
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• Faster Exact Bandwidth
• Optimal Assignments of Numbers to Vertices
• Reducing the bandwidth of a sparse matrix with tabu search.

This page was built for publication: A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs