IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v15y1968i1p49-62.html
   My bibliography  Save this article

Suboptimal algorithms for the quadratic assignment problem

Author

Listed:
  • G. K. Gaschütz
  • J. H. Ahrens

Abstract

The idea of combining relatively simple continuous methods with discrete procedures is used for the construction of suboptimal algorithms for quadratic assignment problems. Depending on the nature of the special problem these steps may vary in complexity. The simplest procedures require minimum storage space and result in tolerable computation times. Different choices of parameters and random variations may be used in order to obtain statistical distributions of suboptimal solutions. Computational results for sample problems indicate improvements on results of Steinberg, Gilmore, and Hillier and Connors.

Suggested Citation

  • G. K. Gaschütz & J. H. Ahrens, 1968. "Suboptimal algorithms for the quadratic assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 15(1), pages 49-62, March.
    • Handle: RePEc:wly:navlog:v:15:y:1968:i:1:p:49-62
    DOI: 10.1002/nav.3800150105
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800150105
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800150105?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navlog:v:15:y:1968:i:1:p:49-62. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.