Optimization is concerned with the efficient computation of the supremum of an objective function f whose domain is restricted to some set of feasible solutions S. These edited notes from the lectures of the January 2004 short course primarily cover the discrete side of optimization. Lecture topics include selected topics from lattice basis reduction in optimization, polyhedral methods in discrete optimization, graphs and combinational optimization, integer programming duality, a study of the design and analysis of approximation algorithms, algebraic recipes for integer programming, and nonlinear and semidefinite programming. The lecture notes include references and the editors have provided a general index. Annotation ©2004 Book News, Inc., Portland, OR (booknews.com)
"synopsis" may belong to another edition of this title.
Seller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Seller Inventory # 11321051-6
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Condition: Like New. Used - Like New. Book is new and unread but may have minor shelf wear. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Seller Inventory # Z1-A-007-02005
Quantity: 1 available
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Hardback. Condition: New. 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, 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. Seller Inventory # LU-9780821835845
Quantity: 1 available
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. illustrated edition. 140 pages. 10.25x7.25x0.50 inches. In Stock. Seller Inventory # __082183584X
Quantity: 2 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FW-9780821835845
Quantity: 2 available
Seller: Rarewaves.com UK, London, United Kingdom
Hardback. Condition: New. 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, 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. Seller Inventory # LU-9780821835845
Quantity: 1 available