scientific article
From MaRDI portal
Publication:3329225
zbMath0541.90075MaRDI QIDQ3329225
Martin Grötschel, László Lovász, Alexander Schrijver
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polytopescombinatorial optimizationconvex setsgeometric algorithmsdiophantine approximationlatticesellipsoid method
Numerical mathematical programming methods (65K05) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Lattices and convex bodies (number-theoretic aspects) (11H06)
Related Items
On Lovász' lattice reduction and the nearest lattice point problem, A geometric inequality and the complexity of computing volume, Solving Linear Programming with Constraints Unknown, Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting), Sensitivity theorems in integer linear programming, Min-max-min robust combinatorial optimization, Non-standard approaches to integer programming, On multivariate quantiles under partial orders
