Theory of linear and integer programming
Theory of linear and integer programming
Integer and combinatorial optimization
Integer and combinatorial optimization
A comparison of the Sherali-Adams, Lov\'\'\'\'341sz-Schrijver and Lasserre relaxations for 0-1 programming
Elementary closures for integer programs
Operations Research Letters
| Hi-index | 0.00 |
Given A ∈ Zm×n and b ∈ Zm, we consider the integer program max{c′x|Ax = b; x ∈ Nn} 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 ∈ Rn|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.