Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Trends in Optimization
 
Edited by: Serkan Hoşten San Fransciso State University, San Francisco, CA
Jon Lee IBM, T.J. Watson Center, Yorktown Heights, NY
Rekha R. Thomas University of Washington, Seattle, WA
Trends in Optimization
Hardcover ISBN:  978-0-8218-3584-5
Product Code:  PSAPM/61
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
eBook ISBN:  978-0-8218-9276-3
Product Code:  PSAPM/61.E
List Price: $99.00
MAA Member Price: $89.10
AMS Member Price: $79.20
Hardcover ISBN:  978-0-8218-3584-5
eBook: ISBN:  978-0-8218-9276-3
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
Trends in Optimization
Click above image for expanded view
Trends in Optimization
Edited by: Serkan Hoşten San Fransciso State University, San Francisco, CA
Jon Lee IBM, T.J. Watson Center, Yorktown Heights, NY
Rekha R. Thomas University of Washington, Seattle, WA
Hardcover ISBN:  978-0-8218-3584-5
Product Code:  PSAPM/61
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
eBook ISBN:  978-0-8218-9276-3
Product Code:  PSAPM/61.E
List Price: $99.00
MAA Member Price: $89.10
AMS Member Price: $79.20
Hardcover ISBN:  978-0-8218-3584-5
eBook ISBN:  978-0-8218-9276-3
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 Details
     
     
    Proceedings of Symposia in Applied Mathematics
    Volume: 612004; 140 pp
    MSC: 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 polynomial-time 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 state-of-the-art of optimization. It is suitable for graduate students and researchers interested in discrete optimization.

    Readership

    Graduate 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 ]
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 612004; 140 pp
MSC: 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 polynomial-time 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 state-of-the-art of optimization. It is suitable for graduate students and researchers interested in discrete optimization.

Readership

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 ]
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
You may be interested in...
Please select which format for which you are requesting permissions.