位置：成果数据库 > 期刊 > 期刊详情页
Approximation algorithms for k-partitioning problems with partition matroid constraint
  • ISSN号：1862-4472
  • 期刊名称：Optimization Letters
  • 时间：2013.4.4
  • 页码：1-7
  • 相关项目：网络中信息传播优化问题的组合结构、算法设计与复杂性分析及应用
作者： Weidong Li and Jianping Li|
同期刊论文项目
网络中信息传播优化问题的组合结构、算法设计与复杂性分析及应用
期刊论文 18 会议论文 3
同项目期刊论文
Shortest path problems with left-side time windows
On the maximum TSP with γ-parameterized triangle inequality
The maximum Hamilton path problem with parameterized triangle inequality
Approximations for two variants of the Steiner tree problem in the Euclidean plane R2
Coordination mechanism for selfish scheduling under a grade of service provision
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
基于动态递归神经网络的石油价格预测
云南省发展生态旅游的对策研究
有色金属板块指数与期货价格相关性研究——基于Copula函数的实证分析
Approximation algorithms for the ring loading problem with penalty cost
On the visualization of strings and fractals of some forbidden words
Approximation schemes for the 3-partitioning problems
Approximation algorithms for constructing some required structures in digraphs
网络中支撑树的边扩容问题
Two approximation schemes for scheduling on parallel machines under a grade of service provision
The capacity expansion path problem in networks