Pages that link to "Item:Q1417505"
From MaRDI portal
The following pages link to GRASP and path relinking for the matrix bandwidth minimization. (Q1417505):
Displaying 26 items.
- A multi-layer line search method to improve the initialization of optimization algorithms (Q320070) (← links)
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- A constructive bandwidth reduction algorithm -- a variant of GPS algorithm (Q504151) (← 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)
- Heuristics for matrix bandwidth reduction (Q858330) (← links)
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (Q862819) (← links)
- Scatter search for the cutwidth minimization problem (Q1761768) (← links)
- Multistart search for the cyclic cutwidth minimization problem (Q2026984) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- A general variable neighborhood search for the cyclic antibandwidth problem (Q2114825) (← 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)
- An improved simulated annealing algorithm for bandwidth minimization (Q2464218) (← links)
- Scatter search --- wellsprings and challenges (Q2570140) (← links)
- Principles of scatter search (Q2570141) (← links)
- Data-mining-driven neighborhood search (Q2815441) (← 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)
- Level-based heuristics and hill climbing for the antibandwidth maximization problem (Q4982954) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)
- Models for two-dimensional bin packing problems with customer order spread (Q6621849) (← links)
