A quadratic assignment problem without column constraints

Thumbnail Image
Authors
Greenberg, Harold
Subjects
Advisors
Date of Issue
1969-09
Date
September 1969
Publisher
Wiley
Language
Abstract
We convert a quadratic assignment problem [1] with a nonconvex objective function into an integer linear program. We then solve the equivalent integer program by a simple enumeration that produces global minima.
Type
Article
Description
The article of record as published may be found at http://dx.doi.org/10.1002/nav.3800160312
URI
https://hdl.handle.net/10945/60198
Series/Report No
Department
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
5 p.
Citation
Greenberg, Harold. "A quadratic assignment problem without column constraints." Naval Research Logistics Quarterly 16.3 (1969): 417-421.
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections
Publications