scientific article; zbMATH DE number 714533

From MaRDI portal
Publication:4321554

zbMath0817.90056MaRDI QIDQ4321554

Jacques A. Ferland, Charles Fleurent

Publication date: 1 August 1995


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



Related Items

An extreme point algorithm for a local minimum solution to the quadratic assignment problem, A survey for the quadratic assignment problem, Variable neighborhood search for the workload balancing problem in service enterprises, Optimization of the quadratic assignment problem using an ant colony algorithm, Location and layout planning. A survey, Genetic and hybrid algorithms for graph coloring, Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs, Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem, An implementation of the iterated tabu search algorithm for the quadratic assignment problem, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem, Mapping the convergence of genetic algorithms, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing, Iterated local search for the quadratic assignment problem, An ejection chain algorithm for the quadratic assignment problem, A hybrid metaheuristic for the quadratic assignment problem, COSEARCH: A parallel cooperative metaheuristic, Hybrid population-based algorithms for the bi-objective quadratic assignment problem, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge, A greedy genetic algorithm for the quadratic assignment problem, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods