Discrete Geometry and Optimization
132.63 CHF
Versandkostenfrei
Lieferzeit: 7-14 Werktage
- Artikel-Nr.: 10437621
Beschreibung
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).
Eigenschaften
Breite: | 194 |
Gewicht: | 685 g |
Höhe: | 241 |
Länge: | 23 |
Seiten: | 336 |
Sprachen: | Englisch |
Autor: | Antoine Deza, Károly Bezdek, Yinyu Ye |
Bewertung
Bewertungen werden nach Überprüfung freigeschaltet.
Zuletzt angesehen