Read Anywhere and on Any Device!

Subscribe to Read | $0.00

Join today and start reading your favorite books for Free!

Create Free Account

Trends in Optimization: American Mathematical Society Short Course, January 5-6, 2004, Phoenix, Arizona

0/5 ( ratings)

This volume presents proceedings from the AMS short course, Trends in Optimization 2004, held at the Joint Mathematics Meetings in Phoenix . It focuses on seven exciting areas of discrete optimization. In particular, Karen Aardal describes Lovasz's fundamental algorithm for producing a short vector in a lattice by basis reduction and H.W. Lenstra's use of this idea in the early 1980s in his polynomial-time algorithm for integer programming in fixed dimension. Aardal's article, lucid presentations of the material. It also contains practical developments using computational tools. Bernd Sturmfels' article, Algebraic recipes for integer programming, discusses how methods of commutative algebra and algebraic combinatorics can be used successfully to attack integer programming problems. Specifically, Grobner bases play a central role in algorithmic theory and practice. Moreover, it is shown that techniques based on short rational functions are bringing new insights, such as in computing the integer programming gap. Overall, these articles, together with five other contributions, make this volume an impressive compilation on the state-of-the-art of optimization. It is suitable for graduate students and researchers interested in discrete optimization.

Language: English

Pages: 140

Format: Hardcover

Publisher: American Mathematical Society

Release: March 01, 2005

ISBN: 082183584X

ISBN 13: 9780821835845

Trends in Optimization: American Mathematical Society Short Course, January 5-6, 2004, Phoenix, Arizona

0/5 ( ratings)

This volume presents proceedings from the AMS short course, Trends in Optimization 2004, held at the Joint Mathematics Meetings in Phoenix . It focuses on seven exciting areas of discrete optimization. In particular, Karen Aardal describes Lovasz's fundamental algorithm for producing a short vector in a lattice by basis reduction and H.W. Lenstra's use of this idea in the early 1980s in his polynomial-time algorithm for integer programming in fixed dimension. Aardal's article, lucid presentations of the material. It also contains practical developments using computational tools. Bernd Sturmfels' article, Algebraic recipes for integer programming, discusses how methods of commutative algebra and algebraic combinatorics can be used successfully to attack integer programming problems. Specifically, Grobner bases play a central role in algorithmic theory and practice. Moreover, it is shown that techniques based on short rational functions are bringing new insights, such as in computing the integer programming gap. Overall, these articles, together with five other contributions, make this volume an impressive compilation on the state-of-the-art of optimization. It is suitable for graduate students and researchers interested in discrete optimization.

Language: English

Pages: 140

Format: Hardcover

Publisher: American Mathematical Society

Release: March 01, 2005

ISBN: 082183584X

ISBN 13: 9780821835845

More books from Jon Lee

THE BEARD GROWTH BIBLE: How to Grow a Beard Regardless of Your Genetics

3.7/5 ( ratings)

A First Course in Combinatorial Optimization

The Beard Growth Bible: How to Grow a Beard Regardless of Your Genetics

EASY KOREAN READING: LEVEL 4 - BOOK 2

EASY KOREAN READING: LEVEL 1 - BOOK 1

Maximum-Entropy Sampling: Algorithms and Application (Springer Series in Operations Research and Financial Engineering)

Maximum-Entropy Sampling: Algorithms and Application (Springer Series in Operations Research and Financial Engineering)

Maximum-Entropy Sampling: Algorithms and Application (Springer Series in Operations Research and Financial Engineering)

Rate this book!

Write a review?