IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i5d10.1007_s10878-025-01302-6.html
   My bibliography  Save this article

The independent quadratic assignment problem: complexity and polynomially solvable special cases

Author

Listed:
  • Ante Ćustić

    (Simon Fraser University Surrey)

  • Wei Yang

    (Northwestern Polytechnical University)

  • Yang Wang

    (Northwestern Polytechnical University)

  • Abraham P. Punnen

    (Simon Fraser University Surrey)

Abstract

In this paper, we study the independent quadratic assignment problem which is a variation of the well-known Koopmans–Beckman quadratic assignment problem. The problem is strongly NP-hard and is also hard to approximate. Some polynomially solvable special cases are identified along with a complete characterization of linearizable instances of the problem, the validity of which is shown to be verifiable in linear time. This improves the existing quadratic bound for this problem. Additional complexity results are also presented.

Suggested Citation

  • Ante Ćustić & Wei Yang & Yang Wang & Abraham P. Punnen, 2025. "The independent quadratic assignment problem: complexity and polynomially solvable special cases," Journal of Combinatorial Optimization, Springer, vol. 49(5), pages 1-11, July.
    • Handle: RePEc:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01302-6
    DOI: 10.1007/s10878-025-01302-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01302-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-025-01302-6?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01302-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.