On the quality of local search for the quadratic assignment problem
type: Item
instance of: scholarly article
title: On the quality of local search for the quadratic assignment problem
zbMATH Open document ID: 0896.90157
DOI: 10.1016/S0166-218X(97)00129-7
author: Eric Angel
author: V. Zissimopoulos
published in: Discrete Applied Mathematics
publication date: 1998-06-02T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1139430
zbMATH Keywords: maximum independent set
zbMATH Keywords: local search
zbMATH Keywords: NP-complete combinatorial optimization
zbMATH Keywords: traveling salesman
zbMATH Keywords: graph bipartitioning
MaRDI profile type: Publication
cites work: Traveling salesman problem and local search
cites work: Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
cites work: Local search and the local structure of NP-complete problems
cites work: How easy is local search?
cites work: Assignment Problems and the Location of Economic Activities
cites work: A new exact algorithm for the solution of quadratic assignment problems
cites work: Q5629659
cites work: Q4321546
cites work: Simple Local Search Problems that are Hard to Solve
OpenAlex ID: W2078027863
description: scientific article; zbMATH DE number 1139430