Integer Programming and Algorithmic Geometry of Numbers

DOI10.1007/978-3-540-68279-0_14zbMath1187.90197OpenAlexW192675268MaRDI QIDQ3565243

Friedrich Eisenbrand

Publication date: 3 June 2010

Published in: 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68279-0_14

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10) Geometry of numbers (11Hxx)

Related Items (9)

Short Presburger Arithmetic Is Hard ⋮ The Computational Complexity of Integer Programming with Alternations ⋮ Complexity of optimizing over the integers ⋮ Optimal divisions of a convex body ⋮ Convex minization over \(\mathbb Z^2\) ⋮ Can Cut-Generating Functions Be Good and Efficient? ⋮ Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems ⋮ COMPLEXITY OF SHORT GENERATING FUNCTIONS ⋮ Reducing Path TSP to TSP

Uses Software

• LattE

This page was built for publication: Integer Programming and Algorithmic Geometry of Numbers