An algorithm for the generalized quadratic assignment problem

Authors:
Peter M. Hahn;Bum-Jin Kim;Monique Guignard;J. Macgregor Smith;Yi-Rong Zhu
Affiliations:
Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, USA 19104-6314;Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, USA 19104-6314;Operations and Information Management, The Wharton School, University of Pennsylvania, Philadelphia, USA 19104-6340;Mechanical and Industrial Engineering, University of Massachusetts Amherst, Amherst, USA 01003-5220;Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, USA 19104-6314
Venue:
Computational Optimization and Applications
Year:
2008

Citing 10
Cited 5

A tight linearization and an algorithm for zero-one quadratic programming problems

Management Science
Linearization strategies for a class of zero-one mixed integer programming problems

Operations Research
An algorithm for finding the K-best allocations of a tree structured program

Journal of Parallel and Distributed Computing
A dual framework for lower bounds of the quadratic assignment problem based on linearization

Computing - Special issue on combinatorial optimization
A class of greedy algorithms for the generalized assignment problem

Discrete Applied Mathematics
Best reduction of the quadratic semi-assignment problem

Discrete Applied Mathematics
Lower Bounds for the Quadratic Assignment Problem Based Upon a Dual Formulation

Operations Research
Solving Lift-and-Project Relaxations of Binary Integer Programs

SIAM Journal on Optimization
Bounds for the quadratic assignment problem using the bundle method

Mathematical Programming: Series A and B
A Memetic Heuristic for the Generalized Quadratic Assignment Problem

INFORMS Journal on Computing

GRASP with path-relinking for the generalized quadratic assignment problem

Journal of Heuristics
Robust Software Partitioning with Multiple Instantiation

INFORMS Journal on Computing
Improving communication latency with the write-only architecture

Journal of Parallel and Distributed Computing
Parallel partitioning for distributed systems using sequential assignment

Journal of Parallel and Distributed Computing
An efficient compact quadratic convex reformulation for general integer quadratic programs

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper reports on a new algorithm for the Generalized Quadratic Assignment problem (GQAP). The GQAP describes a broad class of quadratic integer programming problems, wherein M pair-wise related entities are assigned to N destinations constrained by the destinations' ability to accommodate them. This new algorithm is based on a Reformulation Linearization Technique (RLT) dual ascent procedure. Experimental results show that the runtime of this algorithm is as good or better than other known exact solution methods for problems as large as M=20 and N=15.