On an algorithm for finding integer points on perfect ellipsoids

2021 ◽  
Author(s):  
Otabek Gulomov ◽  
Sadulla Shodiev
Keyword(s):  
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.


1993 ◽  
Vol 71 (1) ◽  
pp. 143-179 ◽  
Author(s):  
W. Duke ◽  
Z. Rudnick ◽  
P. Sarnak

1968 ◽  
Vol 14 (2) ◽  
pp. 141-152 ◽  
Author(s):  
A. Yudin
Keyword(s):  

2009 ◽  
Vol 138 (1) ◽  
pp. 1-23 ◽  
Author(s):  
M. C. Lettington

2009 ◽  
Vol 138 (4) ◽  
pp. 317-327 ◽  
Author(s):  
P. G. Walsh

2009 ◽  
Vol 138 (2) ◽  
pp. 109-136 ◽  
Author(s):  
M. N. Huxley ◽  
S. V. Konyagin
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document