LEADER 04574nam 2200601Ia 450 001 9910739450003321 005 20200520144314.0 010 $a3-319-00200-7 024 7 $a10.1007/978-3-319-00200-2 035 $a(CKB)2670000000533711 035 $a(EBL)1398555 035 $a(OCoLC)858763863 035 $a(SSID)ssj0000962666 035 $a(PQKBManifestationID)11487307 035 $a(PQKBTitleCode)TC0000962666 035 $a(PQKBWorkID)10975868 035 $a(PQKB)10221749 035 $a(DE-He213)978-3-319-00200-2 035 $a(MiAaPQ)EBC1398555 035 $a(PPN)172422086 035 $a(EXLCZ)992670000000533711 100 $a20130506d2013 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aDiscrete geometry and optimization /$fKaroly Bezdek, Antoine Deza, Yinyu Ye, editors 205 $a1st ed. 2013. 210 $aNew York $cSpringer$d2013 215 $a1 online resource (341 p.) 225 0$aFields Institute communications,$x1069-5265 ;$vv. 69 300 $aDescription based upon print version of record. 311 $a3-319-00199-X 311 $a3-319-03312-3 327 $aPreface -- 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).   . 330 $aOptimization 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. 410 0$aFields Institute Communications,$x1069-5265 ;$v69 606 $aDiscrete geometry 606 $aMathematical optimization 615 0$aDiscrete geometry. 615 0$aMathematical optimization. 676 $a516.11 701 $aBezdek$b Karoly$01062468 701 $aYe$b Yinyu$0771525 701 $aDeza$b Antoine$01757024 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910739450003321 996 $aDiscrete geometry and optimization$94194663 997 $aUNINA