scientific article; zbMATH DE number 714537

From MaRDI portal
Publication:4321558

zbMath0817.90057MaRDI QIDQ4321558

Yong Li, Mauricio G. C. Resende, Panos M. Pardalos

Publication date: 16 February 1995


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

A multi-parent genetic algorithm for the quadratic assignment problem, Facility layout problem with QAP formulation under scenario-based uncertainty, A cooperative parallel tabu search algorithm for the quadratic assignment problem, Investigation of a new GRASP-based clustering algorithm applied to biological data, A survey for the quadratic assignment problem, A branch-and-cut algorithm for quadratic assignment problems based on linearizations, A nonmonotone GRASP, Short-term work scheduling with job assignment flexibility for a multi-fleet transport system, Solution methods for the balancing of jet turbines, Metaheuristics: A bibliography, Biologically inspired parent selection in genetic algorithms, A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem, The multi-story space assignment problem, Generating QAP instances with known optimum solution and additively decomposable cost function, A system‐level optimization framework for efficiency and effectiveness improvement of wastewater treatment plants, A parallel water flow algorithm with local search for solving the quadratic assignment problem, Global optimality conditions and optimization methods for quadratic assignment problems, An implementation of the iterated tabu search algorithm for the quadratic assignment problem, Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem, Optimal placement of stereo sensors, An experimental study of variable depth search algorithms for the quadratic assignment problem, Sequential location of two facilities: comparing random to optimal location of the first facility, Mapping the convergence of genetic algorithms, Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms, Effective formulation reductions for the quadratic assignment problem, A hybrid metaheuristic for the quadratic assignment problem, On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem, Greedy randomized adaptive search procedures, GRASP with path-relinking for the generalized quadratic assignment problem, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, A greedy genetic algorithm for the quadratic assignment problem, A GRASP for the biquadratic assignment problem, A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods


Uses Software