2002
DOI: 10.1007/s004930200019
|View full text |Cite
|
Sign up to set email alerts
|

Diophantine Approximations and Integer Points of Cones

Abstract: The purpose of this note is to present a relation between directed best approximations of a rational vector and the elements of the minimal Hilbert basis of certain rational pointed cones. Furthermore, we show that for a special class of these cones the integer Carathéodory property holds true.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2005
2005
2024
2024

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 11 publications
0
4
0
Order By: Relevance
“…This variant, plays also an important role in integer programming and combinatorial optimization, see, e.g. [HW97,HW02].…”
Section: Proof Methodsmentioning
confidence: 99%
“…This variant, plays also an important role in integer programming and combinatorial optimization, see, e.g. [HW97,HW02].…”
Section: Proof Methodsmentioning
confidence: 99%
“…The first example is given by n − 1 standard unit vectors and one additional integral vector r. This setting has been studied with respect to the integer Carathéodory rank and only special instances with the (ICP) are known; see Henk and Weismantel (2002) for some of them. We assume r n = and that the first n − 1 coordinates of r admit at most two different values apart from 0 and − 1, e.g., r = (0, .…”
Section: Special Cones With the (Icp)mentioning
confidence: 99%
“…Pochet and Weismantel [13] provided a linear inequality description of the knapsack set where all variables are bounded. Other hard problems studied under the assumption of divisibility of the coefficients include network design [14], lot-sizing problems [4] and the integer Carathéodory property for rational cones [10].…”
Section: Introductionmentioning
confidence: 99%