Discrete Geometry and Optimization: Fields Institute Communications, cartea 69
Editat de Károly Bezdek, Antoine Deza, Yinyu Yeen Limba Engleză Paperback – 7 aug 2015
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.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 618.03 lei 6-8 săpt. | |
| Springer International Publishing – 7 aug 2015 | 618.03 lei 6-8 săpt. | |
| Hardback (1) | 623.22 lei 6-8 săpt. | |
| Springer International Publishing – 19 iul 2013 | 623.22 lei 6-8 săpt. |
Din seria Fields Institute Communications
- 18%
Preț: 915.13 lei - 18%
Preț: 696.60 lei -
Preț: 368.59 lei - 15%
Preț: 625.57 lei - 15%
Preț: 620.07 lei - 15%
Preț: 619.29 lei - 15%
Preț: 635.80 lei - 15%
Preț: 624.01 lei - 15%
Preț: 623.22 lei - 15%
Preț: 625.88 lei - 15%
Preț: 624.95 lei -
Preț: 377.32 lei - 15%
Preț: 632.19 lei -
Preț: 388.78 lei -
Preț: 439.15 lei -
Preț: 387.67 lei - 15%
Preț: 619.75 lei - 15%
Preț: 616.74 lei - 15%
Preț: 683.42 lei - 18%
Preț: 709.20 lei - 15%
Preț: 670.21 lei - 15%
Preț: 622.29 lei - 18%
Preț: 761.96 lei - 18%
Preț: 755.90 lei - 18%
Preț: 701.62 lei - 18%
Preț: 1339.59 lei - 18%
Preț: 922.85 lei - 18%
Preț: 915.43 lei
Preț: 618.03 lei
Preț vechi: 727.08 lei
-15% Nou
Puncte Express: 927
Preț estimativ în valută:
109.34€ • 127.58$ • 95.60£
109.34€ • 127.58$ • 95.60£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319033129
ISBN-10: 3319033123
Pagini: 336
Ilustrații: X, 336 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:Softcover reprint of the original 1st ed. 2013
Editura: Springer International Publishing
Colecția Springer
Seria Fields Institute Communications
Locul publicării:Cham, Switzerland
ISBN-10: 3319033123
Pagini: 336
Ilustrații: X, 336 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:Softcover reprint of the original 1st ed. 2013
Editura: Springer International Publishing
Colecția Springer
Seria Fields Institute Communications
Locul publicării:Cham, Switzerland
Cuprins
Preface.- Discrete Geometry in Minkowski Spaces (Alonso, Martini, and Spirova).- Engineering Branch-and-Cut Algorithms for the Equicut Program (Anjos, Liers, Pardella, and Schmutzer).- An Approach to the Dodecahedral Conjecture Based on Bounds for Spherical Codes (Anstreicher).- On Minimal Tilings with Convex Cells Each Containing a Unit Ball (Bezdek).- On Volumes of Permutation Polytopes (Burggraf, De Loera, and Omar).- Monotone Paths in Planar Convex Subdivisions and Polytopes (Dumitrescu, Rote, and Toth).- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Eisenberg-Nagy, Laurent, and Varvitsiotis).- The Strong Dodecahedral Conjecture and Fejes Toth's Conjecture on Sphere Packings with Kissing Number Twelve (Hales).- Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints (Jiang, Sun, and Toh).- Techniques for Submodular Maximization (Lee).- A Further Generalization of the Colourful Caratheodory theorem (Meunier, Deza).- Expected Crossing Numbers (Mohar, Stephen).- EL-Labelings and Canonical Spanning Trees for Subword Complexes (Pilaud, Stump).- Bandwidth, Vertex Separators, and Eigenvalue Optimization (Rendl, Lisser, and Piacentini).- Exploiting Symmetries in Polyhedral Computations (Schurmann).- Conditions for Correct Sensor Network Localization Using SDP Relaxation (Shamsi, Taheri, Zhu, and Ye).- A Primal-Dual Smooth Perceptron-von Neumann Algorithm (Soheili, Pena).- Open Problems (Bezdek, Deza, and Ye).
Textul de pe ultima copertă
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.
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.
Caracteristici
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: sn.pub/extras