The following pages link to (Q4424305):
Displaying 13 items.
- Anytime Pareto local search (Q319099) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems (Q1789471) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem (Q2279759) (← links)
- A set of new multi- and many-objective test problems for continuous optimization and a comprehensive experimental evaluation (Q2289008) (← links)
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example (Q2379867) (← links)
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem (Q2506218) (← links)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
- Multi- and many-objective path-relinking: a taxonomy and decomposition approach (Q2668797) (← links)
- Selection hyper-heuristics for the multi and many-objective quadratic assignment problem (Q2676362) (← links)
- A Complex-Networks View of Hard Combinatorial Search Spaces (Q4649208) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)