2018
DOI: 10.1016/j.dam.2017.04.022
|View full text |Cite
|
Sign up to set email alerts
|

Lexicographical polytopes

Abstract: Within a fixed integer box of R n , lexicographical polytopes are the convex hulls of the integer points that are lexicographically between two given integer points. We provide their descriptions by means of linear inequalities.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…The lexicographic order also applies to nonbinary vectors. Given vectors α, β ∈ Z n + , [2,4] characterize the convex hull of bounded integer vectors y satisfying α y β, where extends ≺ by allowing equality. The complete linear description has O(n) constraints, parametrized by maximal and minimal elements with respect to α and β.…”
Section: Introductionmentioning
confidence: 99%
“…The lexicographic order also applies to nonbinary vectors. Given vectors α, β ∈ Z n + , [2,4] characterize the convex hull of bounded integer vectors y satisfying α y β, where extends ≺ by allowing equality. The complete linear description has O(n) constraints, parametrized by maximal and minimal elements with respect to α and β.…”
Section: Introductionmentioning
confidence: 99%
“…For instance, box-TDI polyhedra keep their integrality after being intersected with any integer box [17]. The intersection of two polymatroids [9] or of two lexicographical polytopes [4] is integer. Calvillo characterizes the graphs whose stable set polytope remains integer after being intersected with specific hyperplanes [6].…”
mentioning
confidence: 99%