Test sets of the knapsack problem and simultaneous diophantine approximation

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

Volumn 1284, Issue , 1997, Pages 271-283

  Henk, Martin ^a   Weismantel, Robert ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Diophantine equation; Hilbert basis; Knapsack problem; Simultaneous diophantine approximation; Test sets

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY;

DIOPHANTINE EQUATION; HILBERT BASIS; KNAPSACK PROBLEMS; SIMULTANEOUS DIOPHANTINE APPROXIMATION; TEST SETS;

INTEGRAL EQUATIONS;

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

References (10)

1. P. Conti, C. Traverse, Buchberger algorithm and integer programming, Proceedings AAECC-9 (New Orleans), Springer LNCS 539, 130-139 (1991).
2. W. Cook, J. Fonlupt, and A. Schrijver, An integer analogue of Caratheodory’s theorem, J. Comb. Theory (B) 40, 1986, 63-70.
3. J.G. van der Corput, Über Systeme von linear-homogenen Gleichungen und Ungleichungen, Proceedings Koninklijke Akademie van Wetenschappen te Amsterdam 34, 368-371 (1931).
4. P. Diaconis, R. Graham, and B. Sturmfels, Primitive partition identities, Paul Erdös is 80, Vol. II, Janos Bolyai Society, Budapest, 1-20 (1995).
5. F.R. Giles and W.R. Pulleyblank, Total dual integrality and integer polyhedra, Lineare Algebra Appl. 25, 191-196 (1979).
6. P. Gordan, Über die Auflösung linearer Gleichungen mit reellen Coefficienten, Math. Ann. 6, 23-28 (1873).
7. J. E. Graver, On the foundations of linear and integer programming I, Mathematical Programming 8, 207-226 (1975).
8. J.L. Lambert, Une borne pour les générateurs des solutions entiéres postives d’une équation diophnatienne linéaire, C.R. Acad. Sei. Paris 305, Série I, 1987, 39-40.
9. H. E. Scarf, Neighborhood systems for production sets with indivisibilities, Econometrica 54, 507-532 (1986).
10. A. Sebö, Hilbert bases, Caratheodory’s Theorem and combinatorial optimization, in Proc. of the IPCO conference, Waterloo, Canada, 1990, 431-455.