Variation of cost functions in integer programming

Mathematical Programming, Series B

Volumn 77, Issue 2, 1997, Pages 357-387

  Sturmfels, Bernd ^a   Thomas, Rekha R ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 52449147300     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (28)

1. W.W. Adams and P. Loustaunau, An Introduction to Gröbner Bases, AMS Graduate Studies in Mathematics, Vol. III (Amer. Math. Soc., Providence, RI, 1994).
2. D. Bayer and I. Morrison, Gröbner bases and geometric invariant theory I, Journal of Symbolic Computation 6 (1988) 209-217.
3. D. Bayer and M. Stillman, MACAULAY: A computer algebra system for algebraic geometry. Available by anonymous ftp from zariski.harvard.edu.
4. L.J. Billera and B. Sturmfels, Fiber polytopes, Annals of Mathematics 135 (1992) 527-549.
5. L.J. Billera, P. Filliman and B. Sturmfels, Constructions and complexity of secondary polytopes, Advances in Mathematics 83 (1990) 155-179.
6. L.J. Billera, I.M. Gel'fand and B. Sturmfels, Duality and minors of secondary polyhedra, Journal of Combinatorial Theory B 57 (1993) 258-268.
7. A. Björner, M. Las Vergnas, B. Sturmfels, N. White and G. Ziegler, Oriented Matroids (Cambridge University Press, Cambridge, 1993).
8. C.E. Blair and R.G. Jeroslow, The value function of an integer program, Mathematical Programming 23 (1982) 237-273.
9. P. Conti and C. Traverso, Gröbner bases and integer programming, Proceedings AAECC-9 (New Orleans), Lecture Notes in Computer Science 539 (Springer, Berlin, 1991) 130-139.
10. W. Cook, A.M.H. Gerards, A. Schrijver and É. Tardos, Sensitivity theorems in integer linear programming, Mathematical Programming 34 (1986) 251-264.
11. P. Diaconis and B. Sturmfels, Algebraic algorithms for sampling from conditional distributions, Annals of Statistics, to appear.
12. P. Diaconis, R. Graham and B. Sturmfels, Primitive partition identities, in: D. Miklós, V.T. Sós and T. Szönyi, eds., Combinatorics, Paul Erdös is Eighty, János Bolyai Mathematical Society, Budapest, Hungary (1996) 173-192.
13. H. Edelsbrunner, J. O'Rourke and R. Seidel, Constructing arrangements of lines and hyperplanes with applications, SIAM Journal on Computing 15 (1986) 341-363.
14. D. Eisenbud, Commutative Algebra with a View Towards Algebraic Geometry, Graduate Texts in Mathematics (Springer, Berlin, 1994).
15. I.M. Gel'fand, M. Kapranov and A. Zelevinsky, Multidimensional Determinants, Discriminants and Resultants (Birkhäuser, Boston, 1994).
16. J.E. Graver, On the foundations of linear and integer programming I, Mathematical Programming 8 (1975) 207-226.
17. S. Hosten and B. Sturmfels, GRIN : An implementation of Gröbner bases for integer programming, in: E. Balas and J. Clausen, eds., Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science 920 (Springer, Berlin, 1995) 267-276.
18. R. Kannan, Optimal solution and value of parametric integer programs, in: G. Rinaldi and L. Wolsey, eds., Proceedings of the Third IPCO Conference (1993) 11-21.
19. T. Mora and L. Robbiano, The Gröbner fan of an ideal, Journal of Symbolic Computation 6 (1988) 183-208.
20. H.E. Scarf, Neighborhood systems for production sets with indivisibilities, Econometrica 54 (1986) 507-532.
21. A. Schrijver, Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics and Optimization (Wiley-Interscience, New York, 1986).
22. D. Shallcross, Neighbors of the origin for four by three matrices, Mathematics of Operations Research 17 (1992) 608-614.
23. B. Sturmfels, Gröbner bases of toric varieties, Tôhoku Math. Journal 43 (1991) 249-261.
24. B. Sturmfels, Asymptotic analysis of toric ideals, Memoirs of the Faculty of Science, Kyushu University Ser. A 46 (1992) 217-228.
25. B. Sturmfels, Sparse elimination theory, in: D. Eisenbud and L. Robbiano, eds., Computational Algebraic Geometry and Commutative Algebra, Proceedings Cortona, June 1991 (Cambridge University Press, Cambridge, 1993) 264-298.
26. S.R. Tayur, R.R. Thomas and N.R. Natraj, An algebraic geometry algorithm for scheduling in the presence of setups and correlated demands, Mathematical Programming 69 (1995) 369-401.
27. R.R. Thomas, A geometric Buchberger algorithm for integer programming, Mathematics of Operations Research 20 (1995) 864-884.
28. D.W. Walkup and R.J.-B. Wets, Lifting projections of convex polyhedra, Pacific Journal of Mathematics 28 (1969) 465-475.