Variable neighbourhood search for bandwidth reduction
From MaRDI portal
Publication:2379517
DOI10.1016/j.ejor.2008.12.015zbMath1188.90217OpenAlexW2028089274MaRDI QIDQ2379517
Dionisio Perez-Britos, Dragan Urošević, Carlos G. García-González, Nenad Mladenović
Publication date: 19 March 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.12.015
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (19)
Metaheuristic algorithms for the bandwidth reduction of large-scale matrices ⋮ Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem ⋮ Variable neighborhood search for the pharmacy duty scheduling problem ⋮ Tabu search for the cyclic bandwidth problem ⋮ A variable neighborhood search and simulated annealing hybrid for the profile minimization problem ⋮ A variable neighborhood search heuristic for the maximum ratio clique problem ⋮ Reducing the bandwidth of a sparse matrix with a genetic algorithm ⋮ Variable neighborhood search for metric dimension and minimal doubly resolving set problems ⋮ Multi-objective variable neighborhood search: an application to combinatorial optimization problems ⋮ Efficient iterated greedy for the two-dimensional bandwidth minimization problem ⋮ Variable neighborhood search: the power of change and simplicity ⋮ An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method ⋮ Solving the maximum min-sum dispersion by alternating formulations of two different problems ⋮ A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ An evaluation of low-cost heuristics for matrix bandwidth and profile reductions ⋮ $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices ⋮ Less is more approach in optimization: a road to artificial intelligence ⋮ Addressing the envelope reduction of sparse matrices using a genetic programming system
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Variable neighborhood search for the maximum clique
- Heuristics for matrix bandwidth reduction
- The NP-completeness of the bandwidth minimization problem
- Finding exact solutions to the bandwidth minimization problem
- Variable neighborhood search
- GRASP and path relinking for the matrix bandwidth minimization.
- Reformulation descent applied to circle packing problems
- Greedy randomized adaptive search procedures
- Variable neighborhood decomposition search
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
- Particle swarm optimization and hill climbing for the bandwidth minimization problem
- A branch and bound algorithm for the matrix bandwidth minimization
- An improved simulated annealing algorithm for bandwidth minimization
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- The bandwidth problem for graphs and matrices—a survey
- Complexity Results for Bandwidth Minimization
- Variable Neighborhood Search
- Formulation Space Search for Circle Packing Problems
- Variable neighborhood search: Principles and applications
This page was built for publication: Variable neighbourhood search for bandwidth reduction
