位置：成果数据库 > 期刊 > 期刊详情页
Approximation algorithms for a bi-level knapsack problem
  • ISSN号：0304-3975
  • 期刊名称：Theoretical Computer Science
  • 时间：0
  • 页码：-
  • 相关项目：装箱问题的理论与算法
作者： Chen, Lin|Zhang, Guochuan|
同期刊论文项目
装箱问题的理论与算法
期刊论文 6
同项目期刊论文
A New Upper Bound 2.5545 on 2D Online Bin Packing
Approximation schemes for two-machine flow shop scheduling with two agents
On-line scheduling of multi-core processor tasks with virtualization
Strategy-proof approximation mechanisms for an obnoxious facility game on networks