000 04569nam a22005175i 4500
001 978-3-319-00200-2
003 DE-He213
005 20140220082837.0
007 cr nn 008mamaa
008 130709s2013 gw | s |||| 0|eng d
020 _a9783319002002
_9978-3-319-00200-2
024 7 _a10.1007/978-3-319-00200-2
_2doi
050 4 _aQA639.5-640.7
050 4 _aQA640.7-640.77
072 7 _aPBMW
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aMAT012020
_2bisacsh
072 7 _aMAT008000
_2bisacsh
082 0 4 _a516.1
_223
100 1 _aBezdek, Karoly.
_eeditor.
245 1 0 _aDiscrete Geometry and Optimization
_h[electronic resource] /
_cedited by Karoly Bezdek, Antoine Deza, Yinyu Ye.
264 1 _aHeidelberg :
_bSpringer International Publishing :
_bImprint: Springer,
_c2013.
300 _aX, 336 p. 56 illus., 34 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aFields Institute Communications,
_x1069-5265 ;
_v69
505 0 _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).
520 _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.
650 0 _aMathematics.
650 0 _aDiscrete groups.
650 1 4 _aMathematics.
650 2 4 _aConvex and Discrete Geometry.
650 2 4 _aDiscrete Optimization.
650 2 4 _aOperations Research, Management Science.
700 1 _aDeza, Antoine.
_eeditor.
700 1 _aYe, Yinyu.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319001999
830 0 _aFields Institute Communications,
_x1069-5265 ;
_v69
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-00200-2
912 _aZDB-2-SMA
999 _c96372
_d96372