Pages that link to "Item:Q4229645"
From MaRDI portal
The following pages link to Comparison of iterative searches for the quadratic assignment problem (Q4229645):
Displaying 50 items.
- A multi-alternative approach to control in open systems: origins, current state, and future prospects (Q276780) (← links)
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931) (← links)
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem (Q513133) (← links)
- Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing (Q703914) (← links)
- Confidence in heuristic solutions? (Q746822) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Generating QAP instances with known optimum solution and additively decomposable cost function (Q887857) (← links)
- Random assignment problems (Q953417) (← links)
- Heuristic algorithms for Hadamard matrices with two circulant cores (Q955002) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- Genetic local search with distance preserving recombination operator for a vehicle routing problem. (Q1410618) (← links)
- A novel chaotic search for quadratic assignment problems (Q1598725) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- New linearizations of quadratic assignment problems (Q1761235) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
- The extended concentric tabu for the quadratic assignment problem (Q1887907) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Finding optimal solutions to several gray pattern instances (Q2115324) (← links)
- A landscape-based analysis of fixed temperature and simulated annealing (Q2171587) (← links)
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem (Q2285657) (← links)
- A multi-parent genetic algorithm for the quadratic assignment problem (Q2359229) (← links)
- A parallel water flow algorithm with local search for solving the quadratic assignment problem (Q2423282) (← links)
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (Q2456632) (← links)
- Distance preserving recombination operator for Earth observation satellites operations scheduling (Q2481604) (← links)
- Compounded genetic algorithms for the quadratic assignment problem (Q2488198) (← links)
- Iterated local search for the quadratic assignment problem (Q2503224) (← links)
- A hybrid metaheuristic for the quadratic assignment problem (Q2506186) (← links)
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem (Q2506218) (← links)
- Finding a cluster of points and the grey pattern quadratic assignment problem (Q2507561) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
- Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← links)
- $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
- APPLICATION OF ADAPTIVE NEURO FUZZY INFERENCE SYSTEM IN THE PROCESS OF TRANSPORTATION SUPPORT (Q2836522) (← links)
- AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS (Q2911573) (← links)
- Two effective hybrid metaheuristic algorithms for minimization of multimodal functions (Q3101632) (← links)
- SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration (Q3163728) (← links)
- A New Neighborhood for the QAP (Q3503523) (← links)
- A Complex-Networks View of Hard Combinatorial Search Spaces (Q4649208) (← links)
- An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
