Pages that link to "Item:Q2884562"
From MaRDI portal
The following pages link to A New Genetic Algorithm for the Quadratic Assignment Problem (Q2884562):
Displaying 30 items.
- New heuristic algorithms for solving the planar \(p\)-median problem (Q337669) (← links)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem (Q513133) (← links)
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965) (← 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)
- Assignment problems: a golden anniversary survey (Q852938) (← links)
- The service allocation problem at the Gioia Tauro maritime terminal (Q852990) (← links)
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199) (← links)
- Backbone analysis and algorithm design for the quadratic assignment problem (Q954381) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- Repulsive assignment problem (Q963661) (← links)
- Planning personnel retraining: column generation heuristics (Q1631648) (← links)
- The extended concentric tabu for the quadratic assignment problem (Q1887907) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Directional approach to gradual cover: the continuous case (Q2033708) (← links)
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem (Q2285657) (← links)
- A cooperative parallel tabu search algorithm for the quadratic assignment problem (Q2378423) (← links)
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (Q2456632) (← links)
- Compounded genetic algorithms for the quadratic assignment problem (Q2488198) (← links)
- Iterated local search for the quadratic assignment problem (Q2503224) (← links)
- A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem (Q2666872) (← links)
- New variable-length data compression scheme for solution representation of meta-heuristics (Q2668691) (← links)
- An ejection chain algorithm for the quadratic assignment problem (Q3057181) (← links)
- SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration (Q3163728) (← links)
- Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach (Q3534464) (← links)
- A Supervised Learning Approach Involving Active Subspaces for an Efficient Genetic Algorithm in High-Dimensional Optimization Problems (Q5005000) (← links)
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP (Q5106411) (← links)
- Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← links)
- A graph-based framework for complex system simulating and diagnosis with automatic reconfiguration (Q6581241) (← links)
