An improved simulated annealing algorithm for bandwidth minimization
From MaRDI portal
Publication:2464218
DOI10.1016/j.ejor.2005.12.052zbMath1146.90518OpenAlexW2106318443MaRDI QIDQ2464218
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez
Publication date: 10 December 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.12.052
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Related Items (18)
Alternative evaluation functions for the cyclic bandwidth sum problem ⋮ Variable neighbourhood search for bandwidth reduction ⋮ Tabu search for the cyclic bandwidth problem ⋮ Reducing the bandwidth of a sparse matrix with a genetic algorithm ⋮ A variable depth neighborhood search algorithm for the min-max arc crossing problem ⋮ Efficient iterated greedy for the two-dimensional bandwidth minimization problem ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ Swap-vertex based neighborhood for Steiner tree problems ⋮ A Newton-type algorithm for solving problems of search theory ⋮ Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs ⋮ A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs ⋮ Adaptive memory programming for matrix bandwidth minimization ⋮ An evaluation of low-cost heuristics for matrix bandwidth and profile reductions ⋮ GEM: A novel evolutionary optimization method with improved neighborhood search ⋮ GRASP with path relinking heuristics for the antibandwidth problem ⋮ A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays ⋮ Tabu search for min-max edge crossing in graphs ⋮ Addressing the envelope reduction of sparse matrices using a genetic programming system
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Finding the minimum bandwidth of an interval graph
- The NP-completeness of the bandwidth minimization problem
- Finding exact solutions to the bandwidth minimization problem
- A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systems
- A new matrix bandwidth reduction algorithm
- GRASP and path relinking for the matrix bandwidth minimization.
- Bandwidth of the complete \(k\)-ary tree
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Subgraph ejection chains and tabu search for the crew scheduling problem
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- The Analysis of Large Structural Systems
- Cooling Schedules for Optimal Annealing
- The bandwidth problem for graphs and matrices—a survey
- Complexity Results for Bandwidth Minimization
- Optimal Assignments of Numbers to Vertices
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An improved simulated annealing algorithm for bandwidth minimization