Integer programming and algorithmic geometry of numbers

DOI10.1007/978-3-540-68279-0_14MaRDI QIDQ3565243zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(14)

• Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
• scientific article; zbMATH DE number 4132269 (Why is no real title available?)
• Complexity of short generating functions
• scientific article; zbMATH DE number 3933909 (Why is no real title available?)
• Can cut-generating functions be good and efficient?
• scientific article; zbMATH DE number 4119933 (Why is no real title available?)
• scientific article; zbMATH DE number 922411 (Why is no real title available?)
• Short Presburger Arithmetic Is Hard
• The computational complexity of integer programming with alternations
• Reducing Path TSP to TSP
• Complexity of optimizing over the integers
• Optimal divisions of a convex body
• Convex minization over \(\mathbb Z^2\)
• A threshold phenomenon for the shortest lattice vector problem in the infinity norm

Describes a project that uses

Uses Software

• LattE

This page was built for publication: Integer programming and algorithmic geometry of numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565243)