Minkowski's Convex Body Theorem and Integer Programming

  title={Minkowski's Convex Body Theorem and Integer Programming},
  author={Ravi Kannan},
  journal={Math. Oper. Res.},
  • R. Kannan
  • Published 1 August 1987
  • Mathematics, Computer Science
  • Math. Oper. Res.
The paper presents an algorithm for solving Integer Programming problems whose running time depends on the number n of variables as nOn. This is done by reducing an n variable problem to 2n5i/2 problems in n-i variables for some i greater than zero chosen by the algorithm. The factor of On5/2 “per variable” improves the best previously known factor which is exponential in n. Minkowski's Convex Body theorem and other results from Geometry of Numbers play a crucial role in the algorithm. Several… 

Integer programming, lattice algorithms, and deterministic volume estimation

A new 2O(n) nn time algorithm is given, which yields the fastest currently known algorithm for IP and improves on the classic works of Lenstra and Kannan, to give a new and tighter proof of the atness theorem.

On Integer Programming, Discrepancy, and Convolution

It is shown that improving on the algorithm for any number of constraints is equivalent to improving over the quadratic time algorithm for (min, +)-convolution, which is strong evidence that the algorithm’s running time is the best possible.

Parameterized Integer Quadratic Programming: Variables and Coefficients

It is shown that Optimal Linear Arrangement is fixed parameter tractable parameterized by the size of the smallest vertex cover of the input graph, resolving an open problem from the recent monograph by Downey and Fellows.

A Faster Algorithm for Quasi-convex Integer Polynomial Optimization

A lower time complexity is reached through applying a stronger ellipsoid rounding method and applying a recent advancement in the shortest vector problem to give a smaller exponential-time complexity of a Lenstra-type algorithm.

Solution of the Frobenius Problem and Its Generalization

This paper considers the \Frobenius problem" : Given n natural numbers a 1 ; a 2 ;.. . a n such that their greatest common divisor is 1, nd the largest natural number that is not expressible as a

N ov 2 01 8 On Integer Programming and Convolution ∗

It is shown that further improvements to the pseudopolynomial algorithm for any fixed number of constraints are equivalent to improvements for (min, +)-convolution, which is a strong evidence that the algorithm’s running time is the best possible.

An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming

A practical implementation of a Lenstra-like algorithm, based on the generalized basis reduction method of Lovasz and Scarf (1988), which allows us to avoid the ellipsoidal approximations required in Lenstra's algorithm.

FPT-algorithms for some problems related to integer programming

Fixed-parameter tractable 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 are presented.

On the complexity of quasiconvex integer minimization problem

It is shown that there is no a polynomial algorithm on log R to optimize quasiconvex functions in the ball of radius R using only the comparison oracle, and an exponential on the dimension lower bound for the oracle complexity of the conic function integer optimization problem is presented.



An application of simultaneous diophantine approximation in combinatorial optimization

A preprocessing algorithm is presented to make certain polynomial time algorithms strongly polynomially bounded in the size of the combinatorial structure and which yields the same set of optimal solutions asw.

Improved algorithms for integer programming and related lattice problems

  • R. Kannan
  • Computer Science, Mathematics
  • 1983
The proposed algorithm first finds a “more orthogonal” basis for a lattice than those of Lenstra (1981) and Lenstra, Lenstra and Lovasz (1982), but in time 0(ndn poly (length of input)).

A Polynomial Algorithm for the Two-Variable Integer Programming Problem

ABSTRACT A polynomial time algorithm is presented for solving the following two-variable integer programming problem maximize ClXl + c2x2 subject to a, lxl + a,2x2 = O, integers, where a,j, cj, and

Algorithms to Construct Minkowski Reduced an Hermite Reduced Lattice Bases

Khachian's Algorithm for Linear Programming.

Abstract : L. G. Khachian's algorithm to check the solvability of a system of linear inequalities with integral coefficients is described. The running time of the algorithm is polynomial in the

On Lovász’ lattice reduction and the nearest lattice point problem

  • L. Babai
  • Mathematics, Computer Science
  • 1986
Answering a question of Vera Sós, we show how Lovász’ lattice reduction can be used to find a point of a given lattice, nearest within a factor ofcd (c = const.) to a given point in Rd. We prove that

Lattices and factorization of polynomials

A new algorithm to factorize univariate polynomials over an algebraic number field has been implemented in Algol-68 on a CDC-Cyber 170-750 computer based on a theorem on integral lattices and a theorem giving a lower bound for the length of a shortest-length polynomial having modulo pk a non-trivial common divisor with the minimalPolynomial.

A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables

In this paper a very special knapsack problem is studied, namely, one with only two variables, and a polynomial-time algorithm is presented and analyzed.

Integer Programming with a Fixed Number of Variables

It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable. The proof depends on methods from geometry of numbers.