A new greedy algorithm for the quadratic assignment problem
From MaRDI portal
Publication:1940429
DOI10.1007/s11590-011-0409-9zbMath1267.90062OpenAlexW2058755201MaRDI QIDQ1940429
Leonidas S. Pitsoulis, Theodoros P. Gevezes
Publication date: 7 March 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0409-9
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Symmetry properties of resolving sets and metric bases in hypercubes ⋮ A priority based unbalanced time minimization assignment problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
- Random assignment problems
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
- The greedy algorithm for partially ordered sets
- The quadratic assignment problem. Theory and algorithms
- Complexity of a 3-dimensional assignment problem
- The Quadratic Assignment Problem
- Note on Independence Functions
- Assignment Problems and the Location of Economic Activities
- Worst case analysis of greedy type algorithms for independence systems
- An Efficient Heuristic Procedure for Partitioning Graphs
- P-Complete Approximation Problems
- K-greedy algorithms for independence systems
- An Exact Characterization of Greedy Structures
- Optimal assignments in an ordered set: An application of matroid theory
- Matroids and the greedy algorithm
- Combinatorial optimization. Theory and algorithms.
