Algebraic and Geometric Ideas in the Theory of Discrete Optimization


Price:
Sale price$285.00
Stock:
Temporarily out of stock. Order now & we'll deliver when available

By Jesus De Loera, Raymond Hemmecke, Matthias Koeppe
Imprint:
SIAM - SOCIETY FOR INDUSTRIAL AND APPLIED
Release Date:
Format:
PAPERBACK
Dimensions:
254 x 178 mm
Weight:
630 g
Pages:
333

Request Academic Copy

Button Actions

Please copy the ISBN for submitting review copy form

Description

Jesus A. De Loera is a Professor of Mathematics and a member of the Graduate Groups in Computer Science and Applied Mathematics at University of California, Davis. His research has been recognised by an Alexander von Humboldt Fellowship, the UC Davis Chancellor Fellow award, and the 2010 INFORMS Computing Society Prize. He is an Associate Editor of SIAM Journal of Discrete Mathematics and Discrete Optimization. Raymond Hemmecke is a Professor of Combinatorial Optimization at Technische Universitaet Muenchen. His research interests include algebraic statistics, computer algebra and bioinformatics. Matthias Koeppe is a Professor of mathematics and a member of the Graduate Groups in Computer Science and Applied Mathematics at University of California, Davis. He is an associate editor of Mathematical Programming, Series A and Asia-Pacific Journal of Operational Research.

List of figures; List of tables; List of algorithms; Preface; Part I. Established Tools of Discrete Optimization: 1. Tools from linear and convex optimization; 2. Tools from the geometry of numbers and integer optimization; Part II. Graver Basis Methods: 3. Graver bases; 4. Graver bases for block-structured integer programs; Part III. Generating Function Methods: 5. Introduction to generating functions; 6. Decompositions of indicator functions of polyhedral; 7. Barvinok's short rational generating functions; 8. Global mixed-integer polynomial optimization via the summation method; 9. Multicriteria integer linear optimization via Barvinok-Woods integer projection; Part IV. Groebner Basis Methods: 10. Computations with polynomials; 11. Groebner bases in integer programming; Part V. Nullstellensatz and Positivstellensatz Relaxations: 12. The Nullstellensatz in discrete optimization; 13. Positivity of polynomials and global optimization; 14. Epilogue; Bibliography; Index.

You may also like

Recently viewed