DNA computation model to solve 0-1 programming problem

被引：0
|
作者：
Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China [1 ]
不详 [2 ]
机构：
来源：
Jisuanji Xuebao | 2008年 / 12卷 / 2155-2159期
关键词：
D O I：
10.3724/sp.j.1016.2008.02155
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] A microfluidic systems-based DNA algorithm for solving special 0-1 integer programming problem
    Li, Wanggen
    Ding, Yongsheng
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 185 (02) : 1160 - 1170
  • [42] Dynamic programming based algorithms for the discounted {0-1} knapsack problem
    Rong, Aiying
    Figueira, Jose Rui
    Klamroth, Kathrin
    APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (12) : 6921 - 6933
  • [43] Parallel programming in SRVRT: A case study of 0-1 Knapsack Problem
    Wan, JY
    Xue, JY
    COMPUTER SCIENCE AND TECHNOLOGY IN NEW CENTURY, 2001, : 470 - 473
  • [44] INTERVAL 0-1 PROGRAMMING PROBLEM AND PRODUCT-MIX ANALYSIS
    ISHIBUCHI, H
    TANAKA, H
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1989, 32 (03) : 352 - 370
  • [45] LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM
    Kapoor, R.
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2009, 26 (01) : 59 - 84
  • [46] Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
    Duarte, Abraham
    Laguna, Manuel
    Marti, Rafael
    Sanchez-Oro, Jesus
    COMPUTERS & OPERATIONS RESEARCH, 2014, 51 : 123 - 129
  • [47] THE 0-1 INTEGER PROGRAMMING PROBLEM IN A FINITE RING WITH IDENTITY.
    Rice, Bart
    Computers & mathematics with applications, 1981, 7 (06): : 447 - 450
  • [48] The improvement on algorithm of DNA computing on 0-1 planning problem
    Zhou, Kang
    Tong, Xiao-Jun
    Xu, Jin
    PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2006, : 4282 - +
  • [49] DNA-based algorithm for 0-1 planning problem
    Wang, L
    Chen, ZP
    Jiang, XH
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2005, VOL 4, PROCEEDINGS, 2005, 3483 : 733 - 742
  • [50] CONVERTING 0-1 LINEAR-PROGRAMMING PROBLEM TO A SET-COVERING PROBLEM
    ZORYCHTA, K
    BULLETIN DE L ACADEMIE POLONAISE DES SCIENCES-SERIE DES SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1977, 25 (09): : 919 - 923
12345