Minkowski's Convex Body Theorem and Integer Programming
暂无分享,去创建一个
[1] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[2] Arjen K. Lenstra,et al. Lattices and factorization of polynomials , 1981, SIGS.
[3] András Frank,et al. An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..
[4] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[5] J. Edmonds. Systems of distinct representatives and linear algebra , 1967 .
[6] Ravi Kannan,et al. Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..
[7] Martin Grötschel,et al. Geometric Methods in Combinatorial Optimization , 1984 .
[8] P. Gács,et al. Khachian's Algorithm for Linear Programming. , 1979 .
[9] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[10] Ravi Kannan,et al. Improved algorithms for integer programming and related lattice problems , 1983, STOC.
[11] Bettina Helfrich,et al. Algorithms to Construct Minkowski Reduced an Hermite Reduced Lattice Bases , 1985, Theor. Comput. Sci..
[12] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[13] Ravi Kannan,et al. A Polynomial Algorithm for the Two-Variable Integer Programming Problem , 1980, JACM.
[14] H. F. Blichfeldt. The minimum value of quadratic forms, and the closest packing of spheres , 1929 .
[15] A. Korkine,et al. Sur les formes quadratiques , 1873 .
[16] László Babai,et al. On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..
[17] Chak-Kuen Wong,et al. A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables , 1976, JACM.
[18] Joachim von zur Gathen,et al. Weitere zum Erfüllungsproblem polynomial äquivalente kombinatorische Aufgaben , 1976, Komplexität von Entscheidungsproblemen 1976.
[19] C. A. Rogers,et al. An Introduction to the Geometry of Numbers , 1959 .