Discrete Geometry and Optimization

1. Discrete Geometry in Minkowski Spaces
Javier Alonso, Horst Martini, Margarita Spirova

2. Engineering Branch-and-Cut Algorithms for the Equicut Problem
Miguel F. Anjos, Frauke Liers, Gregor Pardella, Andreas Schmutzer

3. An Approach to the Dodecahedral Conjecture Based on Bounds for Spherical Codes
Kurt M. Anstreicher

4. On Minimal Tilings with Convex Cells Each Containing a Unit Ball
Károly Bezdek

5. On Volumes of Permutation Polytopes
Katherine Burggraf, Jesús Loera, Mohamed Omar

6. Monotone Paths in Planar Convex Subdivisions and Polytopes
Adrian Dumitrescu, Günter Rote, Csaba D. Tóth

7. Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint
Marianna E.-Nagy, Monique Laurent, Antonios Varvitsiotis

8. The Strong Dodecahedral Conjecture and Fejes Tóth’s Conjecture on Sphere Packings with Kissing Number Twelve
Thomas C. Hales

9. Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints
Kaifeng Jiang, Defeng Sun, Kim-Chuan Toh

10. Techniques for Submodular Maximization
Jon Lee

11. A Further Generalization of the Colourful Carathéodory Theorem
Frédéric Meunier, Antoine Deza

12. Expected Crossing Numbers
Bojan Mohar, Tamon Stephen

13. EL-Labelings and Canonical Spanning Trees for Subword Complexes
Vincent Pilaud, Christian Stump

14. Bandwidth, Vertex Separators, and Eigenvalue Optimization
Franz Rendl, Abdel Lisser, Mauro Piacentini

15. Exploiting Symmetries in Polyhedral Computations
Achill Schürmann

16. Conditions for Correct Sensor Network Localization Using SDP Relaxation
Davood Shamsi, Nicole Taheri, Zhisu Zhu, Yinyu Ye

17. A Primal–Dual Smooth Perceptron–von Neumann Algorithm
Negar Soheili, Javier Peña

18. Selected Open Problems in Discrete Geometry and Optimization
Károly Bezdek, Antoine Deza, Yinyu Ye

Avainsanat: Mathematics, Convex and Discrete Geometry, Discrete Optimization, Operations Research, Management Science