Skip to main content

Discrete Geometry and Optimization

  • Book
  • © 2013


  • Contains a wide range of open problems, novel results, and state-of-the-art surveys
  • Presents a snapshot of a rapidly evolving area on the boundary of discrete geometry and optimization
  • Reflects the broad and international participation at the Workshop on Discrete Geometry, Conference on Discrete Geometry and Optimization, and Workshop on Optimization
  • Includes supplementary material:

Part of the book series: Fields Institute Communications (FIC, volume 69)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

​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.  

Similar content being viewed by others


Table of contents (18 chapters)

Editors and Affiliations

  • , Mathematics & Statistics, University of Calgary, Calgary, Canada

    Karoly Bezdek

  • , Department of Computing, McMaster University, Hamilton, Canada

    Antoine Deza

  • School of Engineering, Department of Management Science and Eng, Stanford University, Stanford, USA

    Yinyu Ye

Bibliographic Information

Publish with us