Pages that link to "Item:Q2378423"

The following pages link to A cooperative parallel tabu search algorithm for the quadratic assignment problem (Q2378423):

Displaying 16 items.

• Fast machine reassignment (Q338866) (← links)
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
• An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
• A cooperative hyper-heuristic search framework (Q604941) (← links)
• An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965) (← links)
• Solving the quadratic assignment problem by the repeated iterated tabu search method (Q681911) (← links)
• Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
• Kernel technology to solve discrete optimization problems (Q1699399) (← links)
• Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
• Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints (Q2178318) (← links)
• Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
• Component allocation cost minimization for a multistate computer network subject to a reliability threshold using tabu search (Q2515273) (← 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)
• Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study (Q5131726) (← links)