Pages that link to "Item:Q2464218"
From MaRDI portal
The following pages link to An improved simulated annealing algorithm for bandwidth minimization (Q2464218):
Displaying 21 items.
- Tabu search for the cyclic bandwidth problem (Q337475) (← 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)
- GEM: A novel evolutionary optimization method with improved neighborhood search (Q1021529) (← links)
- Alternative evaluation functions for the cyclic bandwidth sum problem (Q1631512) (← links)
- Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
- A Newton-type algorithm for solving problems of search theory (Q1953229) (← links)
- Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs (Q1999003) (← links)
- Tabu search for min-max edge crossing in graphs (Q2337395) (← links)
- Addressing the envelope reduction of sparse matrices using a genetic programming system (Q2352428) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem (Q2482382) (← links)
- A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507) (← links)
- A simulated annealing with variable neighborhood search approach to construct mixed covering arrays (Q2840782) (← links)
- Reducing the bandwidth of a sparse matrix with a genetic algorithm (Q2926497) (← links)
- GRASP with path relinking heuristics for the antibandwidth problem (Q3100697) (← links)
- Bandwidth reduction by simulated annealing (Q4326300) (← links)
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem (Q6106765) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)
- A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems (Q6561237) (← links)
