国家自然科学基金(10401038)

作品数：7被引量：10H指数：2
导出分析报告
相关作者：韩继业徐大川李改弟更多>>
相关机构：北京工业大学中国科学院数学与系统科学研究院更多>>
相关期刊：《Acta Mathematica Sinica,English Series》《Science China Mathematics》《Acta Mathematicae Applicatae Sinica》更多>>
相关主题：MONOTONICBOUNDSAPPROXIMATIONRELAXATIONQUADRATIC更多>>
相关领域：理学经济管理自然科学总论天文地球更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-6
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Soft-capacitated Facility Location Game被引量：1
《Acta Mathematicae Applicatae Sinica》2010年第1期93-98,共6页Yu Li Da-chuan Xu 
Supported by the National Natural Science Foundation of China(No.60773185,10401038) and Program for Beijing Excellent Talents
We study the soft-capacitated facility location game which is an extension of the facility location game of Pa1 and Tardos. We propose a 6-approximate cross-monotonic cost-sharing method. Numerical tests indicate that...
关键词：Facility location game cross-monotonic COMPETITIVE approximate cost recovery 
A cross-monotonic cost sharing method for the facility location game with service installation costs被引量：4
《Science China Mathematics》2009年第11期2530-2536,共7页XU DaChuan Department of Applied Mathematics,Beijing University of Technology,Beijing 100124,China 
supported by National Natural Science Foundation of China (Grant Nos. 60773185, 10401038);Program for Beijing Excellent Talents (Grant No. 20071D050150020S)
In this paper,we consider the metric uncapacitated facility location game with service installation costs. Our main result is an 11-approximate cross-monotonic cost-sharing method under the assumption that the install...
关键词：facility location game cross-monotonic cost-sharing method linear programming relaxation 90C27 91A12 
Robust Solutions of Uncertain Complex-valued Quadratically Constrained Programs
《Acta Mathematica Sinica,English Series》2008年第8期1279-1290,共12页Da Chuan XU Zheng Hai HUANG 
NsF of China (Grant No.60773185,10401038);Program for Beijing Excellent Talents and NSF of China (Grant No.10571134);the Natural Science Foundation of Tianjin (Grant No.07JCYBJC05200)
In this paper, we discuss complex convex quadratically constrained optimization with uncertain data. Using S-Lemma, we show that the robust counterpart of complex convex quadratically constrained optimization with ell...
关键词：robust optimization quadratically constrained program complex semidefinite program S-Lemma 
Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation被引量：4
《Science China Mathematics》2007年第11期1583-1596,共14页Da-chuan XU~(1+) Shu-zhong ZHANG~2 1 Department of Applied Mathematics,Beijing University of Technology,Beijing 100022,China 2 Department of Systems Engineering and Engineering Management,The Chinese University of Hong Kong,Shatin,Hong Kong,China 
This work was supported by the National Natural Science Foundation of China (Grant No.10401038);Startup Grant for Doctoral Research of Beijing University of Technology and Hong Kong RGC Earmarked Grant CUHK4242/04E
In this paper,we consider a class of quadratic maximization problems.For a subclass of the problems,we show that the SDP relaxation approach yields an approximation solution with the worst-case performance ratio at le...
关键词：quadratic maximization max-cut problem semideflnite programming relaxation approximation algorithm performance ratio 
On KKT points of Celis-Dennis-Tapia subproblem被引量：1
《Science China Mathematics》2006年第5期651-659,共9页LI Gaidi 
supported by the startup grants for doctoral research and the school grants for mathematical research of Beijing University of Technology;the National Natural Science Foundation of China(Grant No.10401038).
The Celis-Dennis-Tapia(CDT) problem is a subproblem of the trust region algorithms for the constrained optimization. CDT subproblem is studied in this paper. It is shown that there exists the KKT point such that the H...
关键词：CDT subproblem  LOCAL solution  OPTIMALITY condition  SADDLE point. 
稠密平分子图与表压缩问题的近似算法
《中国科学（A辑）》2005年第7期745-756,共12页徐大川 韩继业 杜东雷 
国家自然科学基金(批准号:10401038;10171108;10271002;70271014)北京工业大学博士科研启动基金NSERC基金(10004901)资助项目
给出两个NP问题(稠密平分子图和表压缩)的改进的近似算法.基于半定规划(SDP)松弛和巧妙的舍入技巧,首先给出稠密平分子图问题(DSP)的0.5982-近似算法,表压缩问题(TCP)的0.5970-近似算法.然后,通过增加三角不等式得到更紧的SDP松弛,把前...
关键词：近似算法 分子图 压缩 稠密 三角不等式 半定规划 NP问题 贪婪算法 解决问题 SDP 近似比 TCP 松弛 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部