Parametric Integer Programming in Fixed Dimension

References

• Banaszczyk W., Litvak A. E., Pajor A., Szarek S. J. The flatness theorem for nonsymmetric convex bodies via the local theory of Banach spaces. Math. Oper. Res. (1999) 24(3):728–750Link, Google Scholar
• Bárány I., Howe R. E., Lovász L. On integer points in polyhedra: A lower bound. Combinatorica (1992) 12(2):135–142Crossref, Google Scholar
• Barvinok A. A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. (1994) 19(4):769–779Link, Google Scholar
• Barvinok A., Pommersheim J. E., Billera L. J., Björner A., Greene C., Simion R. E., Stanley R. P. An algorithmic theory of lattice points in polyhedra. New Perspectives in Algebraic Combinatorics (1999) 38(Mathematical Sciences Research Institute Publications, Cambridge University Press, Cambridge, UK) 91–147Google Scholar
• Barvinok A., Woods K. M. Short rational generating functions for lattice point problems. J. Amer. Math. Soc. (2003) 16(4):957–979Crossref, Google Scholar
• Bell D. E. A theorem concerning the integer lattice. Stud. Appl. Math. (1977) 56(2):187–188Crossref, Google Scholar
• Cook W. J., Lovász L., Schrijver A., Korte B. H., Ritter K. A polynomial-time test for total dual integrality in fixed dimension. Mathematical Programming at Oberwolfach II, Mathematical Programming Study (1984) 22(North-Holland, Amsterdam) Crossref, Google Scholar
• Cook W. J., Hartmann M. E., Kannan R., McDiarmid C. J. H. On integer points in polyhedra. Combinatorica (1992) 12(1):27–37Crossref, Google Scholar
• Hartmann M. E. Cutting planes and the complexity of the integer hull. (1989) . Doctoral dissertation, Department of Operations Research and Industrial Engineering, Cornell University, Ithaca, NYGoogle Scholar
• Hayes A. C., Larman D. G. The vertices of the knapsack polytope. Discrete Appl. Math. (1983) 6(2):135–138Crossref, Google Scholar
• Hoşten S., Sturmfels B. Computing the integer programming gap. Combinatorica (2007) 27(3):367–382Crossref, Google Scholar
• Kannan R., Cook W. J., Seymour P. D. Test sets for integer programs, ∀ ∃ sentences. Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1990) 1Proc. Workshop on Polyhedral CombinatoricsJune 1989Morristown, NJ(American Mathematical Society, Providence, RI) 39–47Google Scholar
• Kannan R. Lattice translates of a polytope and the Frobenius problem. Combinatorica (1992) 12(2):161–177Crossref, Google Scholar
• Kannan R., Bachem A. Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM J. Comput. (1979) 8(4):499–507Crossref, Google Scholar
• Kannan R., Lovász L. Covering minima and lattice-point-free convex bodies. Ann. Math., Ser. 2 (1988) 128(3):577–602Crossref, Google Scholar
• Kantor J.-M. On the width of lattice-free simplices. Compositio Mathematica (1999) 118(3):235–241Crossref, Google Scholar
• Khachiyan L. G. A polynomial algorithm in linear programming. Doklady Akademii Nauk SSSR (1979) 244:1093–1096(in Russian)Google Scholar
• Khinchin A. Y. A quantitative formulation of Kronecker's theory of approximation. Izvestiya Akademii Nauk SSSR. Seriya Matematicheskaya (1948) 12:113–122(in Russian)Google Scholar
• Köppe M., Verdoolaege S. Computing parametric rational generating functions with a primal Barvinok algorithm. Electronic J. Combinatorics (2008) 15(1):R16 http://www.combinatorics.org/Google Scholar
• Lenstra H. W. Integer programming with a fixed number of variables. Math. Oper. Res. (1983) 8(4):538–548Link, Google Scholar
• Scarf H. E. An observation on the structure of production sets with indivisibilities. Proc. Nat. Acad. Sci. USA (1977) 74(9):3637–3641Crossref, Google Scholar
• Schrijver A.Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization (1986) (John Wiley and Sons, Chichester, UK) Google Scholar
• Sebő A., Cornuéjols G., Burkard R. E., Woeginger G. J. An introduction to empty lattice simplices. Integer Programming and Combinatorial Optim., 7th Internat. IPCO Conf. (1999) 1610June 9–11Graz, Austria(Springer-Verlag)400–414Proceedings, Lecture Notes in Computer ScienceCrossref, Google Scholar
• Shevchenko V. N. On the number of extreme points in integer programming. Kibernetika (1981) 2):133–134(in Russian)Google Scholar
• Stockmeyer L. J. The polynomial-time hierarchy. Theoret. Comput. Sci. (1976) 3(1):1–22Crossref, Google Scholar
• Verdoolaege S., Seghir R., Beyls K., Loechner V., Bruynooghe M. Counting integer points in parametric polytopes using Barvinok's rational functions. Algorithmica (2007) 48(1):37–66Crossref, Google Scholar
• Wrathall C. Complete sets and the polynomial-time hierarchy. Theoret. Comput. Sci. (1976) 3(1):23–33Crossref, Google Scholar