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

Tree‐search algorithms for quadratic assignment problems

Author

Listed:
  • J. F. Pierce
  • W. B. Crowston

Abstract

Problems having the mathematical structure of a quadratic assignment problem are found in a diversity of contexts: by the economist in assigning a number of plants or indivisible operations to a number of different geographical locations; by the architect or indusatrial engineer in laying out activities, offices, or departments in a building; by the human engineer in arranging the indicators and controls in an operators control room; by the electronics engineer in laying out components on a backboard; by the computer systems engineer in arranging information in drum and disc storage; by the production scheduler in sequencing work through a production facility; and so on. In this paper we discuss several types of algorithms for solving such problems, presenting a unifying framework for some of the existing algorithms, and dcscribing some new algorithms. All of the algorithms discussed proceed first to a feasible solution and then to better and better feasible solutions, until ultimately one is discovered which is shown to be optimal.

Suggested Citation

  • J. F. Pierce & W. B. Crowston, 1971. "Tree‐search algorithms for quadratic assignment problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 18(1), pages 1-36, March.
    • Handle: RePEc:wly:navlog:v:18:y:1971:i:1:p:1-36
    DOI: 10.1002/nav.3800180102
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800180102
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800180102?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:18:y:1971:i:1:p:1-36. 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.