volume 32, issue 1, P129-139 2004
DOI: 10.1007/s00454-003-0834-3
View full text
|
|
Share

Abstract: Abstract. Given A ∈ Z m×n and b ∈ Z m , we consider the integer program max{c x|Ax = b; x ∈ N n } and provide an equivalent and explicit linear program max{ c q|Mq = r; q ≥ 0}, where M, r, c are easily obtained from A, b, c with no calculation. We also provide an explicit algebraic characterization of the integer hull of the convex polytope P = {x ∈ R n |Ax = b; x ≥ 0}. All strong valid inequalities can be obtained from the generators of a convex cone whose definition is explicit in terms of M.

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
1
0

Publication Types

Select...

Relationship

0
0

Authors

Journals