Pages that link to "Item:Q2456632"

The following pages link to Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (Q2456632):

Displaying 17 items.

• 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)
• On the unboundedness of facility layout problems (Q604804) (← links)
• An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965) (← links)
• Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
• Computing minimal doubly resolving sets of graphs (Q1013386) (← links)
• Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
• Biologically inspired parent selection in genetic algorithms (Q2178305) (← links)
• A multi-parent genetic algorithm for the quadratic assignment problem (Q2359229) (← links)
• Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly (Q2517416) (← 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 EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS (Q2911573) (← links)
• An ejection chain algorithm for the quadratic assignment problem (Q3057181) (← 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)
• Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study (Q5131726) (← links)