带交互费用的组合最优化问题:复杂性与可解情形
Combinatorial Optimization Problems with Interaction Costs: Complexity and Solvable Cases
摘要:
介绍并研究了带交互费用的组合最优化问题(COPIC)。COPIC是从两个给定的族中找到两个组合结构的问题,使得它们的独立线性成本和两个所选结构的元素之间的交互成本之和最小化。COPIC推广了二次指派问题和许多其他研究得很好的组合最优化问题,因此涵盖了许多现实世界的应用。我们展示了如何在文献中的不同领域的各种主题可以制定为COPIC的特殊情况。本文的主要贡献是结果的计算复杂性和逼近的COPIC为不同的家庭的组合结构(如生成树,路径,拟阵),和特殊结构的相互作用成本。更具体地说,我们分析的复杂性,如果相互作用的成本矩阵是参数化的秩,如果它是一个对角矩阵。此外,我们确定的交叉成本矩阵的结构,使COPIC是等价于独立解决线性最优化问题的两个给定的家庭的组合结构。
英文摘要:
We introduce and study the combinatorial optimization problem with interaction costs (COPIC). COPIC is the problem of finding two combinatorial structures, one from each of two given families, such that the sum of their independent linear costs and the interaction costs between elements of the two selected structures is minimized. COPIC generalizes the quadratic assignment problem and many other well studied combinatorial optimization problems, and hence covers many real world applications. We show how various topics from different areas in the literature can be formulated as special cases of COPIC. The main contributions of this paper are results on the computational complexity and approximability of COPIC for different families of combinatorial structures (e.g. spanning trees, paths, matroids), and special structures of the interaction costs. More specifically, we analyze the complexity if the interaction cost matrix is parameterized by its rank and if it is a diagonal matrix. Also, we determine the structure of the intersection cost matrix, such that COPIC is equivalent to independently solving linear optimization problems for the two given families of combinatorial structures.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。