Pages that link to "Item:Q1306383"
From MaRDI portal
The following pages link to A new matrix bandwidth reduction algorithm (Q1306383):
Displaying 20 items.
- A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs (Q408436) (← links)
- A constructive bandwidth reduction algorithm -- a variant of GPS algorithm (Q504151) (← links)
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (Q725777) (← links)
- Heuristics for matrix bandwidth reduction (Q858330) (← links)
- Finding exact solutions to the bandwidth minimization problem (Q1300222) (← links)
- Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction (Q1913169) (← links)
- Metaheuristic algorithms for the bandwidth reduction of large-scale matrices (Q2136166) (← 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)
- Interchange opportunity in average bandwidth reduction in sparse matrices (Q2845787) (← links)
- Reducing the bandwidth of a sparse matrix with a genetic algorithm (Q2926497) (← links)
- The Bandwidths of a Matrix. A Survey of Algorithms (Q2972909) (← links)
- Bandwidth reduction of rectangular matrices (Q3136817) (← links)
- A hybrid algorithm for reducing matrix bandwidth (Q3340028) (← links)
- Modified bandwidth reduction algorithm (Q3740915) (← links)
- A new mode renumbering algorithm for bandwidth reduction (Q3750035) (← links)
- A new node renumbering algorithm for bandwidth reduction (Q3771501) (← links)
- (Q3776495) (← links)
- Algorithm 807 (Q4406295) (← links)
