期刊文献+

二维瓶颈指派问题的动态规划算法 被引量:4

2-Dimensional Bottleneck Assignment Problem and its Algorithm
下载PDF
导出
摘要 基于前人对一维瓶颈指派问题的算法的研究,讨论了二维瓶颈指派问题,并给出了一种带阀值的动态规划算法。 For the 1-dimensional bottleneck assignment problem, the predecessors had some research work, based on which, in this paper, we discussed and studied a 2-dimensional bottleneck assignment problem. For this problem, we established a dynamic programming algorithm with threshold.
出处 《贵州工业大学学报(自然科学版)》 CAS 2004年第1期6-9,共4页 Journal of Guizhou University of Technology(Natural Science Edition)
关键词 二维瓶颈指派问题 动态规划 算法 阀值 Dynamic programming Bottleneck assignment Threshold
  • 相关文献

参考文献8

  • 1O Gross. The Bottleneck Assignment Problem[M]. Santa Monica:The Rand Corporation, 1959.
  • 2Garfinkel R S. An Improved Algorithm for the Bottleneck Assignment Problem[J]. Oper Res, 1971,19:1747-1751.
  • 3Lawler E L. Combinatorial Optimization[M]. New York:Halt,Rinehart and Winston,1976.
  • 4Hammer P L. Time Minimizing Transportation Problems[J]. Nav Res Log Quart, 1969,16: 345 - 357.
  • 5Garfinkel R S, Rao M R. The Bottleneck Transportation Problem[J]. Nav Res Log Quart, 1971,18: 465-472.
  • 6Szwarc W. Some Remarks on the Time Transportation Problem[J]. Nav Res Log Quart, 1971,18:473-484.
  • 7罗宗俊.一个m维整数瓶颈运输问题及其算法[J].数值计算与计算机应用,2001,22(1):63-70. 被引量:12
  • 8林诒勋.最优化原理的逻辑基础[J].运筹学杂志,1992,11(1):24-27. 被引量:4

二级参考文献3

共引文献13

同被引文献33

  • 1陶世群,蒲保兴.基于遗传算法的多级目标非平衡指派问题求解[J].系统工程理论与实践,2004,24(8):80-85. 被引量:25
  • 2Gross C. The Bottleneck Assignment Problem[M]. P-1630, The Rand Corporation, Santa Monica, California, 1959.
  • 3Garfinkel RS, An improved algorithm for the bottleneck assignment problem [J]. Operations Research,1971, (19):1747-1751.
  • 4Armstrong RD, Jin Z-Y. On solying a variation of the assignment problem[J]. European Journal of Operational Research,1995, (87) :142-147.
  • 5Balinski ML. Signature methods for the assignment problem[J]. Operations Research, 1985, (33) : 527-536.
  • 6Geetha S, Nair KPK. A variation of the assignment problem[J]. European Journal of Operational Research, 1993, (68) :422-426.
  • 7Kuhn HW. The Hungarian method for the assignment problem[J]. Naval Res Log Quart,1956, (3) :253-258.
  • 8Punnen AP. On bottleneck assignment problems under categorization[J]. Computers & Operations Research, 2004, (31) : 151-154.
  • 9Volgenant A. Solving the k-eardinality assignment problem by transformation [J]. European Journal of Operational Research, 2004, (157) : 322-331.
  • 10[3]胡运权,郭耀煌.运筹学教程[M].北京:清华大学出版社,2004.

引证文献4

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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