Pages that link to "Item:Q1300222"
From MaRDI portal
The following pages link to Finding exact solutions to the bandwidth minimization problem (Q1300222):
Displaying 11 items.
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- On bandwidth-2 graphs (Q1348371) (← links)
- GRASP and path relinking for the matrix bandwidth minimization. (Q1417505) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
- A branch and bound algorithm for the matrix bandwidth minimization (Q2462146) (← links)
- An improved simulated annealing algorithm for bandwidth minimization (Q2464218) (← links)
- Reducing the bandwidth of a sparse matrix with a genetic algorithm (Q2926497) (← links)
- The Effective Bandwidth Problem Revisited (Q3548747) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem (Q6106765) (← links)