A new greedy algorithm for the quadratic assignment problem
type: Item
instance of: scholarly article
title: A new greedy algorithm for the quadratic assignment problem
zbMATH Open document ID: 1267.90062
author: Theodoros P. Gevezes
author: Leonidas Pitsoulis
published in: Optimization Letters
publication date: 2013-03-07T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6142302
zbMATH Keywords: approximation algorithms
zbMATH Keywords: quadratic assignment problem
zbMATH Keywords: Greedy algorithm
MaRDI profile type: Publication
full work available at URL: s11590-011-0409-9
OpenAlex ID: W2058755201
cites work: Q4247462
cites work: The quadratic assignment problem. Theory and algorithms
cites work: Matroids and the greedy algorithm
cites work: The greedy algorithm for partially ordered sets
cites work: Complexity of a 3-dimensional assignment problem
cites work: Optimal assignments in an ordered set: An application of matroid theory
cites work: K-greedy algorithms for independence systems
cites work: Worst case analysis of greedy type algorithms for independence systems
cites work: An Exact Characterization of Greedy Structures
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Assignment Problems and the Location of Economic Activities
cites work: Q3928230
cites work: Combinatorial optimization. Theory and algorithms.
cites work: Q4197628
cites work: Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
cites work: Random assignment problems
cites work: The quadratic assignment problem
cites work: Q4321546
cites work: Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
cites work: Note on Independence Functions
cites work: P-Complete Approximation Problems
DOI: 10.1007/S11590-011-0409-9
description: scientific article; zbMATH DE number 6142302