您当前的位置:
首页 >
文章列表页 >
TS to Solve 0-1 Knapsack Problem Based on Double-Tabu Objects
更新时间:2026-09-04
    • TS to Solve 0-1 Knapsack Problem Based on Double-Tabu Objects

    • Vol. 28, Issue 5, Pages: 148-151(2011)
    • Published:2011

    移动端阅览

  • ZHU Hao-dong, LI Hong-chan. TS to Solve 0-1 Knapsack Problem Based on Double-Tabu Objects[J]. 2011, 28(5): 148-151. DOI:

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

11

下载量

0

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Microservices anomaly detection based on the correlation of monitoring metrics
Monte carlo analysis of V-layout trench SiC neutron detector
Implementation and verification of a dual-chain power gating strategy for low power design
Research on assembly action recognition based on MSS-YOLO-MPHands fusion architecture
A feature-oriented context understanding and slice analysis network for tuberculosis detection

Related Author

No data

Related Institution

No data
0