期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

子集和问题的扩展研究 被引量：1

Some Extensions to the Subset-Sum Problem
下载PDF
导出
摘要 基于文献[2]所提出的子集和改进求解算法,我们提出了一些针对具体实际问题的改进方法。基本的思想是将子集和问题进行转化。实验和分析都显示我们方法的有效性。 Based on the algorithm in the document for the Subset-Sum Problem, we proposed some improving solutions to some concrete problems. The basic idea is transforming the Subset-Sum Problem into some concrete problem. Both experimental and analytical results show the efficiency of our methods.
作者 张俊 陶婧
机构地区 芜湖信息技术职业学院软件工程系
出处 《芜湖职业技术学院学报》 2010年第2期44-46,共3页 Journal of Wuhu Institute of Technology
关键词 子集和 分治方法 NP完全问题. subset-sum problem divide and conquer NP complete problem.
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献2

二级参考文献10

  • 1Garey M R,Johnson D S. Computers and intractability: A guide to the theory of NP-Completeness. San Francisco: W. H. Freeman and Co,1979
  • 2Chor B, Rivest R L.A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inform. Theory, 1988,34 (5):901～909
  • 3Laih C-S, Lee, J-Y, Ham L, Su Y-K. Linearly shift knapsack public-key cryptosystem. IEEE J. Selected Areas Commun,1989, 7 (4) :534～539
  • 4Horowitz E,Sahni S. Computing partitions with applications to the knapsack problem. J. ACM,1974,21(2): 2 72～292
  • 5Schroeppel R,Shamir A. A T= O(2n/2),S=O(2n/4) algorithm for certain NP-complete problems. SIAM J. Comput, 1981,10 (3) :456-464
  • 6Ferreira A G. A parallel time/hardware tradeoff T@H= O(2n/2) for the knapsack problem. IEEE Trans. Comput, 1991,40(2): 221～225
  • 7Lou D C, Chang C C. A parallel two-list algorithm for the knapsack problem. Parallel Computing, 1997,22: 1985～ 1996
  • 8Chang H K-C,Chen J J-R,Shyu S-J. A parallel algorithm for the knapsack problem using a generation and searching technique. Parallel Computing,1994,20(2) :233～243
  • 9Cornuejols G,Dawande M. A class of hard small 0-1 programs. 6th International IPCO Conference. Lectures Notes in Computer Science 1998,1412:284～293
  • 10Aardal K,Bixby R E,Hurkens C A J,Lenstra A K,et al. Market split and basis reduction: towards a solution of the Cornuejils Dawande instances. In: 7th Intl. IPCO Conf. Lecture Notes in Computer Science, 1999,1610:1 ～ 16

共引文献2

同被引文献8

  • 1李肯立,李庆华,张红君.子集和问题的改进算法[J].计算机科学,2003,30(11):16-17. 被引量：3
  • 2de Koster R,Le-Duc T,Roodbergen K J. Design and control of warehouse order picking: A literature review [J]. European Journal of Operational Research, 2007,182 (2) : 481-501.
  • 3Yoon C S,Sharp G P. A structured procedure for analysis and design of order pick systems[J]. IIE Transactions, 1996, 28 (5) :379-389.
  • 4Ratliff H D, Rosenthal A S. Order-picking in a rectangular warehouse-A solvable case of the traveling salesman problem [J]. Operations Research, 1983,31(3) : 507-521.
  • 5Gibson DR, Sharp G P. Order batehing procedures[J]. European Journal of Operational Research, 1992,58 (1) : 57-67.
  • 6Yu M F, de Koster R. The impact of order batching and picking area zoning on order picking system performance[J]. European Journal of Operational Research, 2009, 198 (2) : 480-490.
  • 7GuJX, Goetschalckx M, Mcginnis L F. Research on warehouse design and performance evaluation: A comprehensive review[J]. European Journal of Operational Researeh, 2010,203 (3) : 539-549.
  • 8Cormen T H, Leiserson C E, Rivest R L, et al. Introduction to Algorithms[M]. New York: McGraw-Hill, 1990.

引证文献1

二级引证文献2

芜湖职业技术学院学报
2010年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部