Show simple item record

dc.contributor.authorGreenberg, Harold
dc.dateSeptember 1969
dc.date.accessioned2018-10-02T21:26:16Z
dc.date.available2018-10-02T21:26:16Z
dc.date.issued1969-09
dc.identifier.citationGreenberg, Harold. "A quadratic assignment problem without column constraints." Naval Research Logistics Quarterly 16.3 (1969): 417-421.en_US
dc.identifier.urihttp://hdl.handle.net/10945/60198
dc.descriptionThe article of record as published may be found at http://dx.doi.org/10.1002/nav.3800160312en_US
dc.description.abstractWe 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.en_US
dc.format.extent5 p.en_US
dc.publisherWiley Onlineen_US
dc.rightsThis 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.en_US
dc.titleA quadratic assignment problem without column constraintsen_US
dc.typeArticleen_US
dc.contributor.corporateNaval Postgraduate School (U.S.)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record