標(biāo)題: Titlebook: Discrete Geometry and Optimization; Karoly Bezdek,Antoine Deza,Yinyu Ye Book 2013 Springer International Publishing Switzerland 2013 Carat [打印本頁] 作者: 不幸的你 時間: 2025-3-21 19:37
書目名稱Discrete Geometry and Optimization影響因子(影響力)
書目名稱Discrete Geometry and Optimization影響因子(影響力)學(xué)科排名
書目名稱Discrete Geometry and Optimization網(wǎng)絡(luò)公開度
書目名稱Discrete Geometry and Optimization網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discrete Geometry and Optimization被引頻次
書目名稱Discrete Geometry and Optimization被引頻次學(xué)科排名
書目名稱Discrete Geometry and Optimization年度引用
書目名稱Discrete Geometry and Optimization年度引用學(xué)科排名
書目名稱Discrete Geometry and Optimization讀者反饋
書目名稱Discrete Geometry and Optimization讀者反饋學(xué)科排名
作者: 碳水化合物 時間: 2025-3-21 21:24
Engineering Branch-and-Cut Algorithms for the Equicut Problem,dges joining nodes in different partitions is minimum. We compare basic linear and semidefinite relaxations for the equicut problem, and find that linear bounds are competitive with the corresponding semidefinite ones but can be computed much faster. Motivated by an application of equicut in theoret作者: Commemorate 時間: 2025-3-22 02:55 作者: verdict 時間: 2025-3-22 05:55 作者: chalice 時間: 2025-3-22 11:17
Monotone Paths in Planar Convex Subdivisions and Polytopes,there is a path with at least . edges that is monotone in some direction. This bound is the best possible. Consider now a connected subdivision of the plane into . convex faces where exactly . faces are unbounded. Then, there is a path with at least . edges that is monotone in some direction. This b作者: 商店街 時間: 2025-3-22 15:54 作者: 商店街 時間: 2025-3-22 20:48
,The Strong Dodecahedral Conjecture and Fejes Tóth’s Conjecture on Sphere Packings with Kissing Numbthe surface area of every bounded Voronoi cell in a packing of balls of radius 1 is at least that of a regular dodecahedron of inradius 1. The second theorem is L. Fejes Tóth’s conjecture on sphere packings with kissing number twelve, which asserts that in 3-space, any packing of congruent balls suc作者: 修飾語 時間: 2025-3-23 00:27
Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equalitty constraints. For the inner subproblems, we show that the positive definiteness of the generalized Hessian of the objective function for the inner subproblems is equivalent to the constraint nondegeneracy of the corresponding primal problem, which is a key property for applying a semismooth Newton作者: 檢查 時間: 2025-3-23 03:09
Techniques for Submodular Maximization,f a clean and stylized problem, amenable to mathematical analysis, while on the other hand, it comfortably contains several rather different problems which are independently of interest from both theoretical and applied points of view. There have been successful analyses from the point of view of th作者: 顛簸下上 時間: 2025-3-23 08:43
,A Further Generalization of the Colourful Carathéodory Theorem,rful Carathéodory theorem asserts that if the origin . is contained in the convex hull of .. for ., then there exists a colourful simplex containing .. The sufficient condition for the existence of a colourful simplex containing . was generalized to . being contained in the convex hull of . for 1≤.<作者: 安裝 時間: 2025-3-23 13:34 作者: JAMB 時間: 2025-3-23 14:36
EL-Labelings and Canonical Spanning Trees for Subword Complexes,d, we show that they provide canonical spanning trees of the facet-ridge graph of the subword complex, describe inductively these trees, and present their close relations to greedy facets. Searching these trees yields an efficient algorithm to generate all facets of the subword complex, which extend作者: 深淵 時間: 2025-3-23 19:49
Conditions for Correct Sensor Network Localization Using SDP Relaxation,ermine the locations of a group of sensors given the distances between some of them. In this paper, we analyze and determine new sufficient conditions and formulations that guarantee that the SDP relaxation is exact, i.e., gives the correct solution. These conditions can be useful for designing sens作者: noxious 時間: 2025-3-24 01:44
,A Primal–Dual Smooth Perceptron–von Neumann Algorithm, of the perceptron and von Neumann algorithms. Our algorithm retains the simplicity of these algorithms but has a significantly improved convergence rate. Our approach also extends to more general conic systems provided a suitable smoothing oracle is available.作者: deactivate 時間: 2025-3-24 05:08 作者: emission 時間: 2025-3-24 09:34 作者: Trypsin 時間: 2025-3-24 10:48 作者: Root494 時間: 2025-3-24 16:21 作者: 遺傳學(xué) 時間: 2025-3-24 20:37
Book 2013trongly 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 resul作者: 射手座 時間: 2025-3-24 23:54
1069-5265 olved 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 resul978-3-319-03312-9978-3-319-00200-2Series ISSN 1069-5265 Series E-ISSN 2194-1564 作者: 透明 時間: 2025-3-25 04:44 作者: Deject 時間: 2025-3-25 09:56 作者: 陶瓷 時間: 2025-3-25 14:08
Early History and Declassification,This paper focuses on determining the volumes of permutation polytopes associated to cyclic groups,dihedral groups, groups of automorphisms of tree graphs, and Frobenius groups. We do this through the use of triangulations and the calculation of Ehrhart polynomials. We also briefly discuss the theta body hierarchy of various permutation polytopes.作者: 凌辱 時間: 2025-3-25 19:04
Antoine Le Riche,Francesco MagrisIn this note we give a short overview on symmetry exploiting techniques in three different branches of polyhedral computations: The representation conversion problem, integer linear programming and lattice point counting. We describe some of the future challenges and sketch some directions of potential developments.作者: 行為 時間: 2025-3-25 23:34
On Volumes of Permutation Polytopes,This paper focuses on determining the volumes of permutation polytopes associated to cyclic groups,dihedral groups, groups of automorphisms of tree graphs, and Frobenius groups. We do this through the use of triangulations and the calculation of Ehrhart polynomials. We also briefly discuss the theta body hierarchy of various permutation polytopes.作者: 閹割 時間: 2025-3-26 00:22
Exploiting Symmetries in Polyhedral Computations,In this note we give a short overview on symmetry exploiting techniques in three different branches of polyhedral computations: The representation conversion problem, integer linear programming and lattice point counting. We describe some of the future challenges and sketch some directions of potential developments.作者: 親密 時間: 2025-3-26 07:28
On Minimal Tilings with Convex Cells Each Containing a Unit Ball,artitioned into convex cells each containing a unit ball, how should the shapes of the cells be designed to minimize the average edge curvature of the cells? In particular, we prove that the average edge curvature in question is always at least ..作者: 萬靈丹 時間: 2025-3-26 12:32 作者: 知識分子 時間: 2025-3-26 13:09 作者: Legion 時間: 2025-3-26 17:20
Selected Open Problems in Discrete Geometry and Optimization,shop on Discrete Geometry, Conference on Discrete Geometry and Optimization, and Workshop on Optimization. We hope these questions and problems will contribute to further stimulate the interaction between geometers and optimizers.作者: Gullible 時間: 2025-3-26 22:17 作者: Coronary 時間: 2025-3-27 04:39
Fields Institute Communicationshttp://image.papertrans.cn/e/image/281112.jpg作者: Enrage 時間: 2025-3-27 05:24
Sándor Cs?rg?,Rossitza Dodunekovas our goal to demonstrate that still today surprisingly elementary questions (at least from the Euclidean point of view) present parts of the research front in this field. We will discuss incidence theorems, some covering and location problems, group-theoretical aspects, and regularity of figures in作者: 嘴唇可修剪 時間: 2025-3-27 09:38 作者: 高度表 時間: 2025-3-27 13:40
Sun Tzu and the Project Battlegroundinradius one. The conjecture was first stated by L. Fejes Tóth in 1943, and was finally proved by Hales and McLaughlin over 50 years later using techniques developed by Hales for his proof of the Kepler conjecture. In 1964, Fejes Tóth described an approach that would lead to a complete proof of the 作者: Fecundity 時間: 2025-3-27 19:08
Solar Models and Neutrino Problemartitioned into convex cells each containing a unit ball, how should the shapes of the cells be designed to minimize the average edge curvature of the cells? In particular, we prove that the average edge curvature in question is always at least ..作者: brother 時間: 2025-3-28 01:42
Kory P. Schrom,InYoung Kim,Elma D. Baronthere is a path with at least . edges that is monotone in some direction. This bound is the best possible. Consider now a connected subdivision of the plane into . convex faces where exactly . faces are unbounded. Then, there is a path with at least . edges that is monotone in some direction. This b作者: LAIR 時間: 2025-3-28 03:19
Ulrike Leiter,Ulrike Keim,Claus Garbedefinite matrix of rank at most .. We show that this problem is .-hard for any fixed integer . ≥ 2. In other words, for . ≥ 2, it is .-hard to test membership in the rank constrained elliptope ., defined by the set of all partial matrices with an all-ones diagonal and off-diagonal entries specified 作者: 煉油廠 時間: 2025-3-28 06:35 作者: 評論者 時間: 2025-3-28 12:38
Kory P. Schrom,InYoung Kim,Elma D. Baronty constraints. For the inner subproblems, we show that the positive definiteness of the generalized Hessian of the objective function for the inner subproblems is equivalent to the constraint nondegeneracy of the corresponding primal problem, which is a key property for applying a semismooth Newton作者: –LOUS 時間: 2025-3-28 15:06
Sunlight, Vitamin D and Skin Cancerf a clean and stylized problem, amenable to mathematical analysis, while on the other hand, it comfortably contains several rather different problems which are independently of interest from both theoretical and applied points of view. There have been successful analyses from the point of view of th作者: 靦腆 時間: 2025-3-28 20:32 作者: 得意人 時間: 2025-3-29 02:14
Sunspots and Non-Linear Dynamicse independent random variables that are uniformly distributed on [0,1]. The first non-trivial case is ... We compute this via an unexpectedly involved calculation, and consider bounds for larger values of .. A variation of the Crossing Lemma for expectations is proved.作者: FOR 時間: 2025-3-29 06:30 作者: 調(diào)情 時間: 2025-3-29 07:35 作者: 專心 時間: 2025-3-29 15:28
Sunspots: Theory and Observations of the perceptron and von Neumann algorithms. Our algorithm retains the simplicity of these algorithms but has a significantly improved convergence rate. Our approach also extends to more general conic systems provided a suitable smoothing oracle is available.作者: 確定 時間: 2025-3-29 15:37
Fine Structure of Umbrae and Penumbraeshop on Discrete Geometry, Conference on Discrete Geometry and Optimization, and Workshop on Optimization. We hope these questions and problems will contribute to further stimulate the interaction between geometers and optimizers.作者: Orchiectomy 時間: 2025-3-29 20:50
Discrete Geometry and Optimization978-3-319-00200-2Series ISSN 1069-5265 Series E-ISSN 2194-1564 作者: 輕浮思想 時間: 2025-3-30 00:35
Solar Models and Neutrino Problemartitioned into convex cells each containing a unit ball, how should the shapes of the cells be designed to minimize the average edge curvature of the cells? In particular, we prove that the average edge curvature in question is always at least ..作者: arboretum 時間: 2025-3-30 06:04 作者: Glaci冰 時間: 2025-3-30 11:08 作者: synovial-joint 時間: 2025-3-30 14:00 作者: chlorosis 時間: 2025-3-30 17:30 作者: 悄悄移動 時間: 2025-3-30 21:25 作者: 聯(lián)想記憶 時間: 2025-3-31 03:34 作者: 吵鬧 時間: 2025-3-31 07:42 作者: morale 時間: 2025-3-31 10:49 作者: Irrepressible 時間: 2025-3-31 16:13 作者: 砍伐 時間: 2025-3-31 17:48 作者: 刻苦讀書 時間: 2025-3-31 22:28
1069-5265 undary of discrete geometry and optimization.Reflects the br.?Optimization 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作者: 救護(hù)車 時間: 2025-4-1 05:45 作者: microscopic 時間: 2025-4-1 07:15
David E. Hawkins,Shan Rajagopalroposed branch-and-cut algorithm has a better performance than the algorithm of Brunetta et al. Further, it is able to solve to optimality in reasonable time several instances with more than 200 nodes from the physics application.作者: 軍火 時間: 2025-4-1 10:38 作者: Feckless 時間: 2025-4-1 17:19 作者: RAFF 時間: 2025-4-1 21:53
https://doi.org/10.1007/978-3-030-46227-7 an algorithm to find a colourful simplex containing . under the generalized condition. In the plane an alternative, and more general, proof using graphs is given. In addition, we observe that any condition implying the existence of a colourful simplex containing . actually implies the existence of min.|..|such simplices.作者: rheumatology 時間: 2025-4-2 02:07 作者: adulterant 時間: 2025-4-2 03:01
Engineering Branch-and-Cut Algorithms for the Equicut Problem,roposed branch-and-cut algorithm has a better performance than the algorithm of Brunetta et al. Further, it is able to solve to optimality in reasonable time several instances with more than 200 nodes from the physics application.
