Name
Abstract | ||
|---|---|---|
We present a mixed integer version of the lattice analogue of the Farkas lemma. It gives rise to a family of mixed-integer rounding cuts for mixed integer programs, which depend on the choice of a lattice basis. By choosing a Lovasz-reduced basis, one can hope to generate numerically advantageous cutting planes. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.orl.2003.08.003 | Oper. Res. Lett. |
Keywords | Field | DocType |
farkas lemma,mixed integer farkas lemma,lattice analogue,mixed-integer linear programming,mixed-integer rounding cut,mixed integer program,lattice basis,mixed integer version,advantageous cutting plane,cutting planes,lattice bases,lovasz-reduced basis,linear program,cutting plane | Discrete mathematics,Integer square root,Mathematical optimization,Half-integer,Combinatorics,Nearest integer function,Table of Gaussian integer factorizations,Branch and cut,Integer points in convex polyhedra,Integer lattice,Farkas' lemma,Mathematics | Journal |
Volume | Issue | ISSN |
32 | 3 | Operations Research Letters |
Citations | PageRank | References |
4 | 0.64 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias KöPpe | 1 | 191 | 20.95 |
| Robert Weismantel | 2 | 964 | 90.05 |