用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Discrete Geometry and Optimization; Karoly Bezdek,Antoine Deza,Yinyu Ye Book 2013 Springer International Publishing Switzerland 2013 Carat

[复制链接]
查看: 21897|回复: 66
发表于 2025-3-21 19:37:33 | 显示全部楼层 |阅读模式
书目名称Discrete Geometry and Optimization
编辑Karoly Bezdek,Antoine Deza,Yinyu Ye
视频videohttp://file.papertrans.cn/282/281112/281112.mp4
概述Contains a wide range of open problems, novel results, and state-of-the-art surveys.Presents a snapshot of a rapidly evolving area on the boundary of discrete geometry and optimization.Reflects the br
丛书名称Fields Institute Communications
图书封面Titlebook: Discrete Geometry and Optimization;  Karoly Bezdek,Antoine Deza,Yinyu Ye Book 2013 Springer International Publishing Switzerland 2013 Carat
描述.​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 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 resul
出版日期Book 2013
关键词Carathéodory theorem; Combinatorics; Eigenvalue optimization; Minkowski spaces; SDP relaxation; polyhedra
版次1
doihttps://doi.org/10.1007/978-3-319-00200-2
isbn_softcover978-3-319-03312-9
isbn_ebook978-3-319-00200-2Series ISSN 1069-5265 Series E-ISSN 2194-1564
issn_series 1069-5265
copyrightSpringer International Publishing Switzerland 2013
The information of publication is updating

书目名称Discrete Geometry and Optimization影响因子(影响力)




书目名称Discrete Geometry and Optimization影响因子(影响力)学科排名




书目名称Discrete Geometry and Optimization网络公开度




书目名称Discrete Geometry and Optimization网络公开度学科排名




书目名称Discrete Geometry and Optimization被引频次




书目名称Discrete Geometry and Optimization被引频次学科排名




书目名称Discrete Geometry and Optimization年度引用




书目名称Discrete Geometry and Optimization年度引用学科排名




书目名称Discrete Geometry and Optimization读者反馈




书目名称Discrete Geometry and Optimization读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:24:28 | 显示全部楼层
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
发表于 2025-3-22 02:55:50 | 显示全部楼层
发表于 2025-3-22 05:55:52 | 显示全部楼层
发表于 2025-3-22 11:17:27 | 显示全部楼层
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:12 | 显示全部楼层
发表于 2025-3-22 20:48:40 | 显示全部楼层
,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:11 | 显示全部楼层
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:43 | 显示全部楼层
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:39 | 显示全部楼层
,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≤.<
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-22 16:05
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表