solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看3439次
FPT-algorithms for some problems related to integer programming. (arXiv:1712.06309v1 [math.OC])
来源于:arXiv
In this paper, we present FPT-algorithms for special cases of the shortest
lattice vector, integer linear programming, and simplex width computation
problems, when matrices included in the problems' formulations are near square.
The parameter is the maximum absolute value of rank minors of the corresponding
matrices. Additionally, we present FPT-algorithms with respect to the same
parameter for the problems, when the matrices have no singular rank
sub-matrices. 查看全文>>