Test sets and inequalities for integer programs

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

Volumn 1084, Issue , 1996, Pages 16-30

  Thomas, Rekha R ^a   Weismantel, Robert ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; CUTTING TOOLS; SOFTWARE TESTING;

COMPLEXITY RESULTS; CUTTING PLANES; INTEGER PROGRAM; OPTIMAL SOLUTIONS; POLYTOPES; TEST SETS;

INTEGER PROGRAMMING;

EID: 0012652534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_2     Document Type: Conference Paper

References (16)

1. [BM88] D. Bayer and I. Morrison, Gröbner bases and geometric invariant theory I, Journal of Symbolic Computation, 6, 1988, 209-217.
2. [Mac] MACAULAY: a computer algebra system for algebraic geometry, available by anonymous ftp from zarisii.iiarvard.edu.
3. [BiS92] L.J. Billera and B. Sturmfels, Fiber polytopes, Annals of Mathematics, 135, 1992, 527-549.
4. [BFS90] L.J. Billera, P. Filliman and B. Sturmfels, Constructions and complexity of secondary polytopes, Advances in Mathematics, 83, 1990, 155-179.
5. [CT91] P. Conti and C. Traverso, Buchberger algorithm and integer programming, Proceedings AAECC-9 (New Orleans), Springer Verlag LNCS 539, 1991, ISO-139.
6. [GKZ94] I.M. GeI'fand, M. Kapranov and A. Zelevinsky, Multidimensional Determinants, Discriminants and Resultants, Birkhäuser, Boston, 1994.
7. [GLS88] M. Grötschel, L. Lovász, and A. Schrijver: Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics 2, Springer, Berlin, 1988; Second edition 1993.
8. [KSZ92] M.M. Kapranov, B. Sturmfels and A.V.Zelevinsky, Chow polytopes and general resultants, Duke Math. Journal, Vol 67, 1992, 189-218.
9. [MR88] T. Mora and L. Robbiano, The Gröbner fan of an ideal, Journal of Symbolic Computation, 6, 1988, 183-208.
10. [Schr86] A. Schrijver, Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York, 1986.
11. [St91] B. Sturmfels, Gröbner bases of toric varieties, Tôhoku Math. Journal, 43, 1991, 249-261.
12. [St96] B. Sturmfels, Gröbner Bases and Convex Polytopes, AMS University Lecture Series 8, Providence, RI, 1996.
13. [ST94] B.Sturmfels and R.Thomas, Variation of cost functions in integer programming, Technical Report, 1994, Cornell University.
14. [Th94] R.Thomas, A geometric Buchberger algorithm for integer programming, Mathematics of Operations Research, 20, 1995, 864-884.
15. [SWZ95] A. Schulz, R. Weismantel and G. Ziegler, 0/1 integer programming: optimization and augmentation are equivalent, to appear in Proceedings of the European Symposium on Algorithms 95, "Lecture Notes in Computer Science," Springer-Verlag, 1995.
16. [W94] R. Weismantel, "Hilbert bases and the facets of special knapsack polytopes," Preprint SC 94-19, Konrad-Zuse-Zentrum Berlin, 1994.