9783319001999-331900199X-Discrete Geometry and Optimization (Fields Institute Communications, 69)

Discrete Geometry and Optimization (Fields Institute Communications, 69)

ISBN-13: 9783319001999
ISBN-10: 331900199X
Edition: 2013
Author: Yinyu Ye, Antoine Deza, Károly Bezdek
Publication date: 2013
Publisher: Springer
Format: Hardcover 346 pages
FREE US shipping
Buy

From $29.70

Book details

ISBN-13: 9783319001999
ISBN-10: 331900199X
Edition: 2013
Author: Yinyu Ye, Antoine Deza, Károly Bezdek
Publication date: 2013
Publisher: Springer
Format: Hardcover 346 pages

Summary

Discrete Geometry and Optimization (Fields Institute Communications, 69) (ISBN-13: 9783319001999 and ISBN-10: 331900199X), written by authors Yinyu Ye, Antoine Deza, Károly Bezdek, was published by Springer in 2013. With an overall rating of 3.9 stars, it's a notable title among other Operations Research (Processes & Infrastructure, Applied, Mathematics, Pure Mathematics) books. You can easily purchase or rent Discrete Geometry and Optimization (Fields Institute Communications, 69) (Hardcover) from BooksRun, along with many other new and used Operations Research books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $0.47.

Description

Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, the Conference on Discrete Geometry and Optimization, and the Workshop on Optimization, held in September 2011 at the Fields Institute, Toronto, was to further stimulate the interaction between geometers and optimizers. This volume reflects the interplay between these areas. The inspiring Fejes Tóth Lecture Series, delivered by Thomas Hales of the University of Pittsburgh, exemplified this approach. While these fields have recently witnessed a lot of activity and successes, many questions remain open. For example, Fields medalist Stephen Smale stated that the question of the existence of a strongly polynomial time algorithm for linear optimization is one of the most important unsolved problems at the beginning of the 21st century. The broad range of topics covered in this volume demonstrates the many recent and fruitful connections between different approaches, and features novel results and state-of-the-art surveys as well as open problems.  
Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book