Finding exact solutions to the bandwidth minimization problem
From MaRDI portal
Recommendations
Cited in
(16)- A survey of direct methods for sparse linear systems
- A branch and bound algorithm for the matrix bandwidth minimization
- An improved simulated annealing algorithm for bandwidth minimization
- Parallel computation for the bandwidth minimization problem
- A general strategy on the bandwidth minimization (BM) problem
- On the Probable Performance of Heuristics for Bandwidth Minimization
- scientific article; zbMATH DE number 1748479 (Why is no real title available?)
- GRASP and path relinking for the matrix bandwidth minimization.
- Exact and approximate bandwidth
- Reducing the bandwidth of a sparse matrix with a genetic algorithm
- The Effective Bandwidth Problem Revisited
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem
- On bandwidth-2 graphs
- Exact and heuristic solutions to the bandwidth minimization problem
- Variable neighbourhood search for bandwidth reduction
This page was built for publication: Finding exact solutions to the bandwidth minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1300222)