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

IF 1.1 4区数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Combinatorial Optimization Pub Date : 2025-05-21 DOI:10.1007/s10878-025-01302-6

Ante Ćustić, Wei Yang, Yang Wang, Abraham P. Punnen

引用次数: 0

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.

查看原文本刊更多论文

独立二次分配问题：复杂性与多项式可解的特殊情况

本文研究了独立二次分配问题，它是著名的koopmann - beckman二次分配问题的一个变体。这个问题是强np困难的，也很难近似。本文给出了若干多项式可解的特例，并给出了问题线性化实例的完整表征，证明了其有效性在线性时间内是可验证的。这改进了现有问题的二次边界。还给出了额外的复杂性结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Combinatorial Optimization 数学-计算机：跨学科应用

CiteScore

2.00

自引率

10.00%

发文量

审稿时长

6 months

期刊介绍： The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.