scholarly journals Iterated Chvátal--Gomory Cuts and the Geometry of Numbers

2014 ◽  
Vol 24 (3) ◽  
pp. 1294-1312
Author(s):  
Iskander Aliev ◽  
Adam Letchford
4OR ◽  
2020 ◽  
Author(s):  
Michele Conforti ◽  
Marianna De Santis ◽  
Marco Di Summa ◽  
Francesco Rinaldi

AbstractWe consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a lattice basis. To each integer point x in K we associate a family of inequalities (lex-inequalities) that define the convex hull of the integer points in K that are not lexicographically smaller than x. The family of lex-inequalities contains the Chvátal–Gomory cuts, but does not contain and is not contained in the family of split cuts. This provides a finite cutting plane method to solve the integer program $$\min \{cx: x\in S\cap \mathbb {Z}^n\}$$ min { c x : x ∈ S ∩ Z n } , where $$S\subset \mathbb {R}^n$$ S ⊂ R n is a compact set and $$c\in \mathbb {Z}^n$$ c ∈ Z n . We analyze the number of iterations of our algorithm.


Nature ◽  
1947 ◽  
Vol 159 (4029) ◽  
pp. 104-105 ◽  
Keyword(s):  

Author(s):  
Mikołaj Fraczyk ◽  
Gergely Harcos ◽  
Péter Maga

Abstract We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obtain new bounds for the successive minima of ideal lattices. Our arguments combine group theory, ramification theory, and the geometry of numbers.


2002 ◽  
Vol 96 (2) ◽  
pp. 417-431
Author(s):  
Jesse Ira Deutsch
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document