Pages that link to "Item:Q858330"
From MaRDI portal
The following pages link to Heuristics for matrix bandwidth reduction (Q858330):
Displaying 15 items.
- A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs (Q408436) (← links)
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)
- Adaptive memory programming for matrix bandwidth minimization (Q541991) (← links)
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (Q725777) (← links)
- The minimization of open stacks problem: a review of some properties and their use in pre-processing operations (Q1046052) (← links)
- A new matrix bandwidth reduction algorithm (Q1306383) (← links)
- Metaheuristic algorithms for the bandwidth reduction of large-scale matrices (Q2136166) (← links)
- Addressing the envelope reduction of sparse matrices using a genetic programming system (Q2352428) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
- A hybrid technique bandwidth problem for a matrix (Q2893589) (← links)
- Reducing the bandwidth of a sparse matrix with a genetic algorithm (Q2926497) (← links)
- Bandwidth reduction of rectangular matrices (Q3136817) (← links)
- A hybrid algorithm for reducing matrix bandwidth (Q3340028) (← links)
- Reducing the bandwidth of a sparse matrix with tabu search. (Q5952446) (← links)
- Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices (Q5959245) (← links)
