Pages that link to "Item:Q1342320"

The following pages link to A genetic approach to the quadratic assignment problem (Q1342320):

Displaying 32 items.

• Variable neighborhood search for the workload balancing problem in service enterprises (Q337226) (← links)
• Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
• A survey of repair methods used as constraint handling techniques in evolutionary algorithms (Q458493) (← 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)
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
• A genetic algorithm approach for regrouping service sites (Q817228) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• Mapping the convergence of genetic algorithms (Q955480) (← links)
• A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge (Q1002061) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art (Q1348274) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• Hope: A genetic algorithm for the unequal area facility layout problem. (Q1406662) (← links)
• A greedy genetic algorithm for the quadratic assignment problem (Q1577374) (← links)
• Solving an assignment-selection problem with verbal information and using genetic algorithms (Q1806733) (← links)
• An extreme point algorithm for a local minimum solution to the quadratic assignment problem (Q1877896) (← links)
• Solving the redundancy allocation problem using a combined neural network/genetic algorithm approach (Q1915970) (← links)
• Genetic and hybrid algorithms for graph coloring (Q1919854) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Genetic search and the dynamic layout problem (Q1977622) (← links)
• A new algorithm for solving a special matching problem with a general form value function under constraints (Q2287164) (← links)
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (Q2456632) (← links)
• A hybrid metaheuristic for the quadratic assignment problem (Q2506186) (← links)
• A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem (Q2666872) (← links)
• $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
• PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID (Q2909213) (← links)
• Two-level modified simulated annealing based approach for solving facility layout problem (Q3498919) (← links)
• Relative Position Indexing Approach (Q3649624) (← links)
• A genetic algorithm for facility layout (Q4399133) (← links)
• Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
• Adaptive memory programming: a unified view of metaheuristics (Q5954822) (← links)