Pages that link to "Item:Q5952446"
From MaRDI portal
The following pages link to Reducing the bandwidth of a sparse matrix with tabu search. (Q5952446):
Displaying 17 items.
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)
- Adaptive memory programming for matrix bandwidth minimization (Q541991) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (Q725777) (← links)
- Heuristics for matrix bandwidth reduction (Q858330) (← links)
- A general variable neighborhood search for the cyclic antibandwidth problem (Q2114825) (← 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)
- Particle swarm optimization and hill climbing for the bandwidth minimization problem (Q2383955) (← links)
- A branch and bound algorithm for the matrix bandwidth minimization (Q2462146) (← links)
- Data-mining-driven neighborhood search (Q2815441) (← 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)
- GRASP with path relinking heuristics for the antibandwidth problem (Q3100697) (← links)
- Level-based heuristics and hill climbing for the antibandwidth maximization problem (Q4982954) (← links)
