Hardcover ISBN:  9780821835845 
Product Code:  PSAPM/61 
List Price:  $125.00 
MAA Member Price:  $112.50 
AMS Member Price:  $100.00 
eBook ISBN:  9780821892763 
Product Code:  PSAPM/61.E 
List Price:  $99.00 
MAA Member Price:  $89.10 
AMS Member Price:  $79.20 
Hardcover ISBN:  9780821835845 
eBook: ISBN:  9780821892763 
Product Code:  PSAPM/61.B 
List Price:  $224.00 $174.50 
MAA Member Price:  $201.60 $157.05 
AMS Member Price:  $179.20 $139.60 
Hardcover ISBN:  9780821835845 
Product Code:  PSAPM/61 
List Price:  $125.00 
MAA Member Price:  $112.50 
AMS Member Price:  $100.00 
eBook ISBN:  9780821892763 
Product Code:  PSAPM/61.E 
List Price:  $99.00 
MAA Member Price:  $89.10 
AMS Member Price:  $79.20 
Hardcover ISBN:  9780821835845 
eBook ISBN:  9780821892763 
Product Code:  PSAPM/61.B 
List Price:  $224.00 $174.50 
MAA Member Price:  $201.60 $157.05 
AMS Member Price:  $179.20 $139.60 

Book DetailsProceedings of Symposia in Applied MathematicsVolume: 61; 2004; 140 ppMSC: Primary 05; 13; 42; 52; 90
This volume presents proceedings from the AMS short course, Trends in Optimization 2004, held at the Joint Mathematics Meetings in Phoenix (AZ). 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 polynomialtime algorithm for integer programming in fixed dimension. Aardal's article, "Lattice basis reduction in optimization: Selected Topics", is one of the most 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, Gröbner 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 stateoftheart of optimization. It is suitable for graduate students and researchers interested in discrete optimization.
ReadershipGraduate students and research mathematicians interested in discrete optimization.

Table of Contents

Articles

Karen Aardal — Lattice basis reduction in optimization: selected topics [ MR 2104728 ]

Alper Atamtürk — Polyhedral methods in discrete optimization [ MR 2104729 ]

Gérard Cornuéjols — Graphs and combinatorial optimization [ MR 2104730 ]

Jean B. Lasserre — Integer programming duality [ MR 2104731 ]

David B. Shmoys — The design and analysis of approximation algorithms: Facility location as a case study [ MR 2104732 ]

Bernd Sturmfels — Algebraic recipes for integer programming [ MR 2104733 ]

Stephen J. Wright — Nonlinear and semidefinite programming [ MR 2104734 ]


RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
This volume presents proceedings from the AMS short course, Trends in Optimization 2004, held at the Joint Mathematics Meetings in Phoenix (AZ). 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 polynomialtime algorithm for integer programming in fixed dimension. Aardal's article, "Lattice basis reduction in optimization: Selected Topics", is one of the most 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, Gröbner 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 stateoftheart of optimization. It is suitable for graduate students and researchers interested in discrete optimization.
Graduate students and research mathematicians interested in discrete optimization.

Articles

Karen Aardal — Lattice basis reduction in optimization: selected topics [ MR 2104728 ]

Alper Atamtürk — Polyhedral methods in discrete optimization [ MR 2104729 ]

Gérard Cornuéjols — Graphs and combinatorial optimization [ MR 2104730 ]

Jean B. Lasserre — Integer programming duality [ MR 2104731 ]

David B. Shmoys — The design and analysis of approximation algorithms: Facility location as a case study [ MR 2104732 ]

Bernd Sturmfels — Algebraic recipes for integer programming [ MR 2104733 ]

Stephen J. Wright — Nonlinear and semidefinite programming [ MR 2104734 ]