Representation of sets of lattice points

SIAM Journal on Optimization

Volumn 18, Issue 1, 2007, Pages 133-137

  Hemmecke, Raymond ^a   Weismantel, Robert ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Hubert basis; Integral generating set; Lattice; Optimality certificate; Representation

Indexed keywords

INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION;

HUBERT BASIS; INTEGRAL GENERATING SETS; LATTICE POINTS; NONNEGATIVE INTEGER LINEAR REPRESENTATION; OPTIMALITY CERTIFICATE;

SET THEORY;

EID: 38749142984     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/040616474     Document Type: Article

References (8)

1. D. BERTSIMAS AND R. WEISMANTEL, Optimization Over Integers, Dynamic Ideas, Belmont, MA, 2005.
2. F. R. GILES AND W. R. PULLEYBLANK, Total dual integrality and integer polyhedra, Linear Algebra Appl., 25 (1979), pp. 191-196.
3. P. GORDAN, Über die Auflösung linearer Gleichungen mit reellen Coefficienten, Math. Ann., 6 (1873), pp. 23-28.
4. J. E. GRAVER, On the foundation of linear and integer programming I, Math. Programming, 9 (1975), pp. 207-226.
5. U. U. HAUS, M. KOPPE, AND R. WEISMANTEL, The integral basis method for integer programming, Math. Methods Oper. Res., 53 (2001), pp. 281-307.
6. R. G. JEROSLOW, Some basis theorems for integral monoids, Math. Oper. Res., 3 (1978), pp. 145-154.
7. A. SCHRIJVER, Theory of Linear and Integer Programming, Wiley, Chichester, 1986.
8. J. G. VAN DER CORPUT, Uber Systeme von linear-homogenen Gleichungen und Ungleichungen, Proceedings Koninklijke Akademie van Wetenschappen te Amsterdam, 34 (1931), pp. 368-371.