Fast Integer Programming in Fixed Dimension
It is shown that the optimum of an integer program in fixed dimension, which is defined by a fixed number of constraints, can be computed with O(s) basic arithmetic operations, where s is the binary encoding length of the input. This improves on the quadratic running time of previous algorithms which are based on Lenstra’s algorithm and binary search.
It follows that an integer program in fixed dimension, which is defined by m constraints, each of binary encoding length at most s, can be solved with an expected number of O(m + log(m)s) arithmetic operations using Clarkson’s random sampling algorithm.
KeywordsInteger Program Rational Number Arithmetic Operation Integer Point Integral Vector
Unable to display preview. Download preview PDF.
- 6.Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freemann, San Francisco (1979)Google Scholar
- 7.Gärtner, B., Welzl, E.: Linear programming—randomization and abstract frameworks. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 669–687. Springer, Heidelberg (1996)Google Scholar