Discrete geometry and optimization
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, t...
שמור ב:
| מחברים אחרים: | , , |
|---|---|
| פורמט: | Livre numérique |
| שפה: | Anglais |
| יצא לאור: |
Cham :
Springer International Publishing
[20..].
Cham : Springer Nature |
| מהדורה: | 1st ed. 2013. |
| סדרה: | Fields Institute Communications
69 |
| גישה מקוונת: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| הערה: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Discrete geometry and optimization, Károly Bezdek, Antoine Deza, Yinyu Ye, editors, New York, Springer, 2013, 1 vol. (X-336 p.), Fields Institute communications, 978-3-319-00199-9 • Discrete Geometry and Optimization, Texte imprimé, 9783319033129 • Discrete Geometry and Optimization, Texte imprimé, 9783319002019 |
תוכן הענינים:
- 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)