A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
DOI10.1016/j.cor.2017.06.002zbMath1391.90529OpenAlexW2620802925MaRDI QIDQ1652400
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.06.002
combinatorial optimizationsimulated annealingvariable neighborhood searchgraph profilematrix profile
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Fast local search for single row facility layout
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
- Adaptive memory programming for matrix bandwidth minimization
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Variable neighbourhood search: methods and applications
- Profile minimization problem for matrices and graphs
- Two improved algorithms for envelope and wavefront reduction
- Unravelling small world networks
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
- Profile minimization on triangulated triangles
- Addressing the envelope reduction of sparse matrices using a genetic programming system
- Variable neighbourhood search for bandwidth reduction
- A Multilevel Algorithm for Wavefront Reduction
- Minimizing the Profile of a Symmetric Matrix
- Reducing the bandwidth of a sparse matrix with a genetic algorithm
- The Bandwidths of a Matrix. A Survey of Algorithms
- The university of Florida sparse matrix collection
- Near-minimal matrix profiles and wavefronts for testing nodal resequencing algorithms
- An algorithm for profile and wavefront reduction of sparse matrices
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- The Profile Minimization Problem in Trees
- Simulated annealing for profile and fill reduction of sparse matrices
- Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
- A spectral algorithm for envelope reduction of sparse matrices
- The use of profile reduction algorithms with a frontal code
- Implementing Hager's exchange methods for matrix profile reduction
- A survey of direct methods for sparse linear systems
- Sparse matrices
- Variable neighborhood search: Principles and applications
This page was built for publication: A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
