MARC Record from harvard_bibliographic_metadata

LEADER: 04370cam a2200469Ia 4500
001 013744349-8
005 20140205104813.0
006 m o d
008 130722s2013 nyu o 000 0 eng d
020 $a9783319002002 (electronic bk.)
020 $a3319002007 (electronic bk.)
020 $z9783319001999
035 0 $aocn853447874
040 $aGW5XE$cGW5XE$dN$T$dYDXCP$dCOO$dE7B$dIDEBK$dHLS
050 4 $aQA640.7$b.D57 2013
072 7 $aMAT$x012000$2bisacsh
082 04 $a516/.11$223
245 00 $aDiscrete geometry and optimization$h[electronic resource] /$cKároly Bezdek, Antoine Deza, Yinyu Ye, editors.
260 $aNew York :$bSpringer,$cc2013.
300 $a1 online resource (x, [336] p.)
490 1 $aFields Institute communications,$x1069-5265 ;$vv.69
588 $aDescription based on print version record.
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).$cỹ
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 $aDiscrete geometry.
650 0 $aMathematical optimization.
650 7 $aMATHEMATICS / Geometry / General$2bisacsh
653 4 $aMathematics.
653 4 $aDiscrete groups.
653 4 $aConvex and Discrete Geometry.
653 4 $aDiscrete Optimization.
653 4 $aOperations Research, Management Science.
655 4 $aElectronic books.
700 1 $aBezdek, Károly.
700 1 $aDeza, Antoine,$d1966-
700 1 $aYe, Yinyu.
776 08 $iPrint version:$tDiscrete geometry and optimization$w(OCoLC)828488007
830 0 $aFields Institute communications ;$vv.69.
899 $a415_565982
988 $a20130802
049 $aHLSS
906 $0OCLC