Decomposition of integer programs and of generating sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1284, Issue , 1997, Pages 92-1O3

  Cornuejols, G ^a   Urbaniak, R ^b   Weismantel, R ^b   Wolsey, L ^c  

^a CMU ^*  (United States)

^b ZUSE INSTITUTE BERLIN   (Germany)

^c CORE ^*  (Belgium)

Author keywords

Generating set; Group theoretic approach; Integer programming; Knapsack problem; Primal method; Scaling; Test set

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONES; GROUP THEORY; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION;

GENERATING SET; GROUP THEORETIC APPROACH; KNAPSACK PROBLEMS; PRIMAL METHOD; SCALING; TEST SETS;

INTEGER PROGRAMMING;

EID: 84949200730     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63397-9_8     Document Type: Conference Paper

References (8)

1. A. Brauer & J. E. Shockley: On a problem of Frobenius, Journal für reine und angewandte Mathematik 211 (1962) 399-408
2. P. Diaconis & R. Graham & B. Sturmfels: Primitive partition identities, Paul Erdös is 80. Vol. II, Janos Bolyai Society, Budapest (1995) 1-20
3. R. E. Gomory: Some polyhedra related to combinatorial problems, Linear Algebra and its Applications 2 (1969) 451-558
4. J. E. Graver: On the foundations of linear and integer programming I, Mathematical Programming 8 (1975) 207-226
5. R. Kannan: Solution of the Frobenius problem and its generalizations, Manuscript (1991)
6. E. S. Selmer: On the linear diophantine problem of Frobenius, Journal für reine und angewandte Mathematik 293/294 (1977), 1-17
7. R. R. Thomas: Gröbner basis methods for integer programming, PhD. Dissertation, Cornell University, (1994)
8. R. Urbaniak & R. Weismantel & G. Ziegler: A variant of Buchberger’s algorithm for integer programming, SIAM J. Discrete Math., Vol 1, No 10, (1997) 96-108