CaltechAUTHORS
Published October 27, 1999 | Version Submitted
Technical Report Open

Solving Certain Large Instances of the Quadratic Assignment Problem: Steinberg's Examples

Creators

Abstract

This report discusses techniques for the solution of the quadratic assignment problem (QAP) and describes a prototype implementation used to solve two large (n = 36) instances of the problem.

Additional Information

© 1999 California Institute of Technology. October 27, 1999. The work described in this paper was supported by the Defense Advance Research Projects Agency (DARPA) and monitored by the Office of Army Research. It was also supported in part by Okawa Foundation Research Grant, and computer systems used for the implementation were donated by Intel Corporation. At the time of writing, the author is supported by an IBM Research Fellowship.

Attached Files

Submitted - 10.1.1.25.2138.ComputerScienceReportneedDOI.pdf

Files

10.1.1.25.2138.ComputerScienceReportneedDOI.pdf

Files (253.7 kB)

Name Size
md5:3bd37027885fa9bc64774844d9abeb5f
253.7 kB Preview Download

Additional details

Identifiers

Eprint ID
26920
Resolver ID
CaltechCSTR:2001.010

Funding

Defense Advance Research Projects Agency (DARPA)
Okawa Foundation
IBM

Dates

Created
2001-12-12
Created from EPrint's datestamp field
Updated
2019-10-03
Created from EPrint's last_modified field

Caltech Custom Metadata

Caltech groups
Computer Science Technical Reports