Pages that link to "Item:Q817180"

The following pages link to Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180):

Displaying 36 items.

• A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
• A nonmonotone GRASP (Q340011) (← links)
• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← 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)
• On the unboundedness of facility layout problems (Q604804) (← links)
• The multi-story space assignment problem (Q610966) (← links)
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← links)
• An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965) (← links)
• Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (Q823888) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199) (← links)
• Generating QAP instances with known optimum solution and additively decomposable cost function (Q887857) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
• The single-finger keyboard layout problem (Q1025249) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• New linearizations of quadratic assignment problems (Q1761235) (← links)
• Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
• A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
• A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
• Finding optimal solutions to several gray pattern instances (Q2115324) (← links)
• Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
• Embedding signed graphs in the line (Q2253962) (← 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)
• Estimating the number of basins of attraction of multi-objective combinatorial problems (Q2424731) (← links)
• Iterated local search for the quadratic assignment problem (Q2503224) (← links)
• Finding a cluster of points and the grey pattern quadratic assignment problem (Q2507561) (← links)
• New variable-length data compression scheme for solution representation of meta-heuristics (Q2668691) (← links)
• A New Neighborhood for the QAP (Q3503523) (← links)
• An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
• Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study (Q5131726) (← links)
• Evolutionary Computation in Combinatorial Optimization (Q5901738) (← links)
• Where the really hard quadratic assignment problems are: the QAP-SAT instances (Q6635983) (← links)