您的位置: 专家智库 > >

国家自然科学基金(60773185)

作品数:5 被引量:5H指数:1
相关作者:徐大川姜春艳更多>>
相关机构:中国人民武装警察部队学院北京工业大学更多>>
发文基金:国家自然科学基金天津市自然科学基金北京市自然科学基金更多>>
相关领域:理学自动化与计算机技术天文地球更多>>

文献类型

  • 4篇中文期刊文章

领域

  • 4篇理学
  • 2篇自动化与计算...
  • 1篇天文地球

主题

  • 1篇线性规划
  • 1篇PROGRA...
  • 1篇UNCERT...
  • 1篇UNIFOR...
  • 1篇VALUED
  • 1篇APA
  • 1篇COMPLE...
  • 1篇CONSTR...
  • 1篇DUAL
  • 1篇LEMMA
  • 1篇惩罚
  • 1篇FAULT-...
  • 1篇TED
  • 1篇T-C
  • 1篇MONOTO...
  • 1篇CONCAV...
  • 1篇COMPET...
  • 1篇APPROX...
  • 1篇FITTIN...

机构

  • 1篇北京工业大学
  • 1篇中国人民武装...

作者

  • 1篇姜春艳
  • 1篇徐大川

传媒

  • 2篇Acta M...
  • 1篇应用数学学报
  • 1篇Acta M...

年份

  • 1篇2012
  • 1篇2010
  • 1篇2009
  • 1篇2008
5 条 记 录,以下是 1-4
排序方式:
Soft-capacitated Facility Location Game被引量:1
2010年
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 the method is effective.
Yu LiDa-chuan Xu
关键词:COMPETITIVE
Robust Solutions of Uncertain Complex-valued Quadratically Constrained Programs
2008年
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 ellipsoidal or intersection-of-two-ellipsoids uncertainty set leads to a complex semidefinite program. By exploring the approximate S-Lemma, we give a complex semidefinite program which approximates the NP-hard robust counterpart of complex convex quadratic optimization with intersection-of-ellipsoids uncertainty set.
Da Chuan XUZheng Hai HUANG
带惩罚的动态设施选址问题的近似算法被引量:4
2009年
本文研究带惩罚的动态设施选址问题,在该问题中假设不同时段内设施的开放费用、用户的需求及连接费用可以不相同,而且允许用户的需求不被满足,但是要有惩罚.对此问题我们给出了第一个近似比为1.8526的原始对偶(组合)算法.
姜春艳徐大川
关键词:线性规划
Fault-tolerant Concave Facility Location Problem with Uniform Requirements
2012年
In this paper, we consider the fault-tolerant concave facility location problem (FTCFL) with uniform requirements. By investigating the structure of the FTCFL, we obtain a modified dual-fitting bifactor approximation algorithm. Combining the scaling and greedy argumentation technique, the approximation factor is proved to be 1.52.
Xing WANGDa-Chuan XUZheng-Hai HUANG
共1页<1>
聚类工具0