Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 777

The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.

Minkowski's Convex Body Theorem and Integer Programming

Open access
Kannan, Ravi·1987·Mathematics of Operations Research

Abstract

The paper presents an algorithm for solving Integer Programming problems whose running time depends on the number n of variables as n O(n). This is done by reducing an n variable problem to (2n)5i/2 problems in n − i variables for some i greater than zero chosen by the algorithm. The factor of O(n 5/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 related algorithms for lattice problems are presented. The complexity of these problems with respect to polynomial-time reducibilities is studied.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1287/moor.12.3.415

Cites

11 of 11 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 11 references

Cited by

See all 777

Metadata

Authors
Kannan, R.
Venue
Mathematics of Operations Research
Published
1987-08
Volume
12
Issue
3
Pages
415-440
ISSN
  • 0364-765X (ISSN-L)
  • 1526-5471
OpenAlex
W2026129593
Cited by
777
References
11
FWCI
3.77
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Minkowski's Convex Body Theorem and Integer Programming. https://app.cochat.ai/papers/10.1287/moor.12.3.415
The paper
Kannan, R. (1987). Minkowski's Convex Body Theorem and Integer Programming. Mathematics of Operations Research. https://doi.org/10.1287/moor.12.3.415

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.