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

Ante Ćustić (), Wei Yang (), Yang Wang () and Abraham P. Punnen ()
Additional contact information
Ante Ćustić: Simon Fraser University Surrey
Wei Yang: Northwestern Polytechnical University
Yang Wang: Northwestern Polytechnical University
Abraham P. Punnen: Simon Fraser University Surrey

Journal of Combinatorial Optimization, 2025, vol. 49, issue 5, No 2, 11 pages

Abstract: 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.

Keywords: Quadratic optimization; Complexity; Linearization; Combinatorial optimization; Independent quadratic assignment (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01302-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01302-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01302-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().