An Algorithm for the Generalized Quadratic Assignment Problem

Loading...
Thumbnail Image
Penn collection
Operations, Information and Decisions Papers
Degree type
Discipline
Subject
combinatorial optimization
branch-and-bound
quadratic assignment problem
reformulation linearization technique
lagrangian dual
dual ascent procedure
Other Mathematics
Other Physical Sciences and Mathematics
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Hahn, Peter M
Kim, Bum-jin
Monique, Guignard-Spielberg
Smith, John MacGregor
Zhu, Yi-Rong
Contributor
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.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2008-07-01
Journal title
Computational Optimization and Applications
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Recommended citation
Collection