Integer programming and algorithmic geometry of numbers

DOI10.1007/978-3-540-68279-0_14zbMATH Open1187.90197OpenAlexW192675268MaRDI QIDQ3565243FDOQ3565243

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

Recommendations

• Publication:4733665
• Publication:3033845
• Publication:4893085
• scientific article
• scientific article; zbMATH DE number 922411

Mathematics Subject Classification ID

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

Cited In (13)

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

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)