Pages that link to "Item:Q2379517"
From MaRDI portal
The following pages link to Variable neighbourhood search for bandwidth reduction (Q2379517):
Displayed 19 items.
- Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem (Q320805) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (Q725777) (← links)
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems (Q887201) (← links)
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem (Q1652400) (← links)
- A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431) (← links)
- Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method (Q1993591) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Less is more approach in optimization: a road to artificial intelligence (Q2070138) (← 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)
- $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
- Reducing the bandwidth of a sparse matrix with a genetic algorithm (Q2926497) (← links)
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem (Q6106765) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)