Skip to main content
SpringerLink
Log in

GRIN: An implementation of Gröbner bases for integer programming

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 920))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.W. Adams and P. Loustaunau, An Introduction to Gröbner Bases, American Mathematical Society, Graduate Studies in Mathematics, Vol. III, 1994.

    Google Scholar 

  2. D. Bayer & M. Stillman, Macaulay: a computer algebra system for algebraic geometry, available by anonymous ftp from zariski.harvard.edu.

    Google Scholar 

  3. T. Becker and V. Weispfenning, Gröbner bases: a computational approach to commutative algebra, Graduate Texts in Mathematics 141, Springer-Verlag 1993.

    Google Scholar 

  4. P. Conti and C. Traverso, Gröbner bases and integer programming, Proceedings AAECC-9 (New Orleans), Springer Verlag, LNCS 539 (1991) 130–139.

    Google Scholar 

  5. D. Cox, J. Little and D. O'Shea, Ideals, Varieties and Algorithms, Springer Verlag, New York, 1992.

    Google Scholar 

  6. Di Biase, F., Urbanke, R., An algorithm to compute the kernel of certain polynomial ring homomorphisms, Experimental Mathematics, to appear.

    Google Scholar 

  7. P. Diaconis and B. Sturmfels, Algebraic algorithms for sampling from conditional distributions, Annals of Statistics, to appear.

    Google Scholar 

  8. R. Gebauer and H.M. Möller, On an installation of Buchberger's algorithm, Journal of Symbolic Computation 6 (1988) 275–286.

    Google Scholar 

  9. L. Lovász, An Algorithmic Theory of Numbers, Graphs and Convexity, CBMS-NSF Regional Conference Series in Applied Mathematics 50, Society for Industrial and Applied Mathematics (SIAM), Philadelphia 1986.

    Google Scholar 

  10. C. Moulinet-Ossola, Algoritmique des Réseaux et des Systèmes Diophantiens Linéares, Dissertation, L'Université de Nice Sophia-Antipolis, 1995.

    Google Scholar 

  11. N.R. Natraj, S.R. Tayur and R.R. Thomas, An algebraic geometry algorithm for scheduling in the presence of setups and correlated demands, Mathematical Programming, to appear.

    Google Scholar 

  12. L. Pottier, Minimal solutions to linear diophantine systems: bounds and algorithms, in Proceedings RTA '91, Como, Springer LNCS 488, pp. 162–173.

    Google Scholar 

  13. H.E. Scarf, Neighborhood systems for production sets with indivisibilities, Econometrica 54 (1986) 507–532.

    Google Scholar 

  14. A. Schrijver, Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York, 1986.

    Google Scholar 

  15. B. Sturmfels, Gröbner Bases and Convex Polytopes, American Mathematical Society, 1996, to appear

    Google Scholar 

  16. B. Sturmfels and R. R. Thomas, Variation of cost functions in integer programming, Manuscript, 1994.

    Google Scholar 

  17. B. Sturmfels, R. Weismantel and G. Ziegler, Gröbner bases of lattices, corner polyhedra and integer programming, Manuscript, 1994.

    Google Scholar 

  18. R.R. Thomas, A geometric Buchberger algorithm for integer programming, Mathematics of Operations Research, to appear.

    Google Scholar 

  19. R. Urbaniak, R. Weismantel and G. Ziegler, A variant of the Buchberger algorithm for integer programming, Manuscript, Konrad-Zuse-Zentrum für Informationstechnik, Berlin, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Operations Research and Industrial Engineering, Cornell University, 14853, Ithaca, New York, USA

    Serkan Hoşten

  2. Department of Mathematics, University of California, 94720, Berkeley, California, USA

    Bernd Sturmfels

Authors
  1. Serkan Hoşten
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernd Sturmfels
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Balas Jens Clausen

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hoşten, S., Sturmfels, B. (1995). GRIN: An implementation of Gröbner bases for integer programming. In: Balas, E., Clausen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1995. Lecture Notes in Computer Science, vol 920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59408-6_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-59408-6_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59408-6

  • Online ISBN: 978-3-540-49245-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation