Showing 2017Show all
3 papers · 1 filter
math.OC2017
FPT-algorithms for some problems related to integer programming
D. V. Gribanov, D. S. Malyshev, P. M. Pardalos +1
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 include…
math.OC2017
The Width and Integer Optimization on Simplices With Bounded Minors of the Constraint Matrices
D. V. Gribanov, A. Y. Chirkov
In this paper, we will show that the width of simplices defined by systems of linear inequalities can be computed in polynomial time if some minors of their constraint matrices are…
math.OC2017
FPT-algorithms for The Shortest Lattice Vector and Integer Linear Programming Problems
D. V. Gribanov
In this paper, we present FPT-algorithms for special cases of the shortest vector problem (SVP) and the integer linear programming problem (ILP), when matrices included to the prob…