当前位置: X-MOL 学术Discret. Optim. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Block-structured integer programming: Can we parameterize without the largest coefficient?
Discrete Optimization ( IF 1.1 ) Pub Date : 2022-10-12 , DOI: 10.1016/j.disopt.2022.100743
Hua Chen , Lin Chen , Guochuan Zhang

We consider 4-block n-fold integer programming, which can be written as max{wx:Hx=b,lxu,xZN}, where the constraint matrix H is composed of small matrices A,B,C,D such that the first row of H is (C,D,D,,D), the first column of H is (C,B,B,,B), the main diagonal of H is (C,A,A,,A), and all the other entries are 0. There are n copies of D, B, and A. The special case where B=C=0 is known as n-fold integer programming.

Prior algorithmic results for 4-block n-fold integer programming and its special cases usually take Δ, the largest absolute value among entries of H, as part of the parameters. In this paper, we explore the possibility of solving the problems polynomially when the number of rows and columns of the small matrices are constant. We show that, assuming PNP, this is not possible even if A=(1,1,Δ) and B=C=0. However, this becomes possible if A=(1,,1) or AZ1×2, or more generally if AZsA×tA, tA=sA+1 and the rank of matrix A satisfies that rank(A)=sA.



中文翻译:

块结构整数规划:我们可以在没有最大系数的情况下进行参数化吗?

我们考虑 4-blockn-fold 整数规划,可以写成最大限度{wXHX=b,lX,XZñ}, 其中约束矩阵H由小矩阵组成一个,,C,D这样第一行H(C,D,D,,D),第一列H(C,,,,), 的主对角线H(C,一个,一个,,一个),所有其他条目为0。有n的副本D,, 和一个. 特殊情况=C=0被称为n-折叠整数规划。

4块的先验算法结果n-fold 整数规划及其特殊情况通常需要Δ, 的条目中最大的绝对值H,作为参数的一部分。在本文中,我们探讨了当小矩阵的行数和列数恒定时,多项式求解问题的可能性。我们证明,假设NP, 这也是不可能的,即使一个=(1,1,Δ)=C=0. 然而,这成为可能,如果一个=(1,,1)或者一个Z1×2,或更一般地,如果一个Zs一个×一个,一个=s一个+1和矩阵的秩一个满足(一个)=s一个.

更新日期:2022-10-12
down
wechat
bug