
2013 / xx + 322 pages / Softcover / ISBN: 9781611972436 / List Price $112.50 / MOS/SIAM Member Price $78.75 / Order Code MO14
Keywords: discrete optimization, integer and combinatorial optimization, algorithms and complexity, computational mathematics, mathematical optimization
Contents
Preface
Index
This book presents recent advances in the mathematical theory of discrete optimization, particularly those supported by methods from algebraic geometry, commutative algebra, convex and discrete geometry, generating functions, and other tools normally considered outside the standard curriculum in optimization.
Algebraic and Geometric Ideas in the Theory of Discrete Optimization
Audience
This book can be used as a textbook for advanced undergraduates or beginning graduate students in mathematics, computer science, or operations research or as a tutorial for mathematicians, engineers, and scientists engaged in computation who wish to delve more deeply into how and why algorithms do or do not work.
About the Authors
Jesús 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 recognized 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 Universität München. His research interests include algebraic statistics, computer algebra, and bioinformatics.
Matthias Köppe 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 AsiaPacific Journal of Operational Research.
ISBN: 9781611972436