FPT-algorithms for some problems related to integer programming
Optimization and Control
2022-11-30 v2 Computational Complexity
Data Structures and Algorithms
Abstract
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.
Cite
@article{arxiv.1712.06309,
title = {FPT-algorithms for some problems related to integer programming},
author = {D. V. Gribanov and D. S. Malyshev and P. M. Pardalos and S. I. Veselov},
journal= {arXiv preprint arXiv:1712.06309},
year = {2022}
}
Comments
arXiv admin note: text overlap with arXiv:1710.00321 From author: some minor corrections has been done