Pages that link to "Item:Q1342106"
From MaRDI portal
The following pages link to A study of diversification strategies for the quadratic assignment problem (Q1342106):
Displaying 15 items.
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251) (← links)
- Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
- A molecular structure matching problem (Q1361391) (← links)
- TSP ejection chains (Q1363749) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation (Q1609910) (← links)
- Solving the multiple competitive facilities location problem (Q1847246) (← links)
- Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
- Solving the damper placement problem via local search heuristics (Q1908999) (← links)
- Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Massively parallel tabu search for the quadratic assignment problem (Q2367011) (← links)
- Scheduling using tabu search methods with intensification and diversification (Q5945316) (← links)
