Minkowski's Convex Body Theorem and Integer Programming
From MaRDI portal
Publication:3780763
DOI10.1287/moor.12.3.415zbMath0639.90069WikidataQ94973792 ScholiaQ94973792MaRDI QIDQ3780763
Publication date: 1987
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/925308b01e1a3a9944774a817c63d84c887ee277
68Q25: Analysis of algorithms and problem complexity
90C10: Integer programming
52Bxx: Polytopes and polyhedra
Related Items
Block Reduced Lattice Bases and Successive Minima, Predicting nonlinear pseudorandom number generators, Non-standard approaches to integer programming, On integer points in polyhedra, Lattice translates of a polytope and the Frobenius problem, Complexity of the closest vector problem in a lattice generated by a (0,1)-matrix, Test sets of integer programs, Computing the Ehrhart polynomial of a convex lattice polytope, Lattice basis reduction: Improved practical algorithms and solving subset sum problems, The hardness of approximate optima in lattices, codes, and systems of linear equations, Finding a shortest vector in a two-dimensional lattice modulo m, Cutting-plane proofs in polynomial space