Generating QAP instances with known optimum solution and additively decomposable cost function
type: Item
instance of: scholarly article
title: Generating QAP instances with known optimum solution and additively decomposable cost function
zbMATH Open document ID: 1334.90141
published in: Journal of Combinatorial Optimization
publication date: 2015-11-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6503872
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: metaheuristics
zbMATH Keywords: quadratic assignment problem
zbMATH Keywords: instance generator
zbMATH Keywords: additively decomposable functions
zbMATH Keywords: landscape analysis
author: Madalina M. Drugan
describes a project that uses: QAPLIB
MaRDI profile type: Publication
OpenAlex ID: W2012559977
cites work: QAPLIB - a quadratic assignment problem library
cites work: The quadratic assignment problem. Theory and algorithms
cites work: Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
cites work: A survey for the quadratic assignment problem
cites work: Two classes of quadratic assignment problems that are solvable as linear assignment problems
cites work: Efficiency of local search with multiple local optima
cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
cites work: A New Lower Bound Via Projection for the Quadratic Assignment Problem
cites work: Random assignment problems
cites work: Q4321558
cites work: Q4762950
cites work: Advances in metaheuristics for hard optimization
cites work: Evolutionary Computation in Combinatorial Optimization
cites work: Comparison of iterative searches for the quadratic assignment problem
cites work: New linearizations of quadratic assignment problems
DOI: 10.1007/S10878-013-9689-6
description: scientific article; zbMATH DE number 6503872