Generating QAP instances with known optimum solution and additively decomposable cost function

DOI10.1007/s10878-013-9689-6zbMath1334.90141OpenAlexW2012559977MaRDI QIDQ887857

Madalina M. Drugan

Publication date: 3 November 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/77590c77-5e6d-4252-9ed8-856cadae6601

zbMATH Keywords

combinatorial optimizationmetaheuristicsquadratic assignment problemlandscape analysisadditively decomposable functionsinstance generator

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

Selection hyper-heuristics for the multi and many-objective quadratic assignment problem

Uses Software

• QAPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Two classes of quadratic assignment problems that are solvable as linear assignment problems
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
• A survey for the quadratic assignment problem
• Random assignment problems
• QAPLIB - a quadratic assignment problem library
• The quadratic assignment problem. Theory and algorithms
• New linearizations of quadratic assignment problems
• Advances in metaheuristics for hard optimization
• Efficiency of Local Search with Multiple Local Optima
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• Comparison of iterative searches for the quadratic assignment problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: Generating QAP instances with known optimum solution and additively decomposable cost function