期刊文献+

关于顶点教学的一点探索

An Exploration of the Teaching of Vertex
下载PDF
导出
摘要 基本可行解是运筹学中的一个重点问题,也是教学的一个难点,基本可行解对应可行域的一个顶点,理解顶点的概念有助于理解基本可行解,基本可行解又是运筹学的理论基础。作者给出了关于顶点的一点见解,将顶点与基本可行解的关系转化为两个等价命题来说明,希望能对运筹学的教学有所帮助。 Basic feasible solution is not only an important problembut also an difficult problem;a basic feasible solution corresponds toa vertex of feasible field,which is helpful for understanding the definition of the basic feasible solution to understand the definition ofvertex,and the basic feasible solution is theoretical basis of operations research.Here the author of this paper gives some opinions,translatesthe relationship between the vertex and basic feasible solution into two equivalent proposition,hoping that it is useful for teachingof operations research.
作者 王常春 冉杰 汤小燕 WANG Chang-chun;RAN Jie;TANG Xiao-yan(Department of Mathematics, Zunyi Normal College, Zunyi 563006, China)
出处 《遵义师范学院学报》 2017年第3期121-122,共2页 Journal of Zunyi Normal University
基金 贵州省科技合作计划项目(黔科合LH字[2016]7031号 黔科合LH字[2016]7029号)
关键词 顶点 基本可行解 凸组合 内点 vertex basic feasible solution convex combination inner point
  • 相关文献

参考文献2

二级参考文献10

  • 1庞博. 动态网络中的流问题. 国防科技大学硕士研究生毕业论文, 2009.
  • 2Corley H W, Chang H. Find the n Most Vital Nodes in a Flow Network. Management Science, 1975, 25(5): 531-539.
  • 3Corley H W, Sha D Y. Most Vital Links and Nodes in Weighted Network. Operations Research Letters, 1982, (1): 157-161.
  • 4Tarjan R E. Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees. Information Process Letters, 1982, 14(1): 30-33.
  • 5Nardelli E, Proietti G, Widmayer P. Finding the Most Vital Node of a Shortest Path. Theor. Comput. Sci., 2003, 296: 167-177.
  • 6Ramkumar R, James B O, Nilopal C. Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs. MIT Sloan Working Paper, 2004, 4391-4402.
  • 7Manku G S. An O(m+nlog*n) Algorithm for Sensitivity Analysis of Minimum Spanning Trees, 1994.
  • 8Liang W. Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for Fixed k. Discrete Applied Mathematics, 2001, 113: 319-327.
  • 9Deepinder Sidhu, Raj Nair, Shukri Abdallah. Finding Disjoint Paths in Networks. ACM SIGCOMM Computer Communication Review, 1991, 21(4): 43-51.
  • 10孙智帅,谢政,陈挚.独立路径问题的算法设计[J].计算机工程,2013,39(8):142-146. 被引量:2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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