Dantzig G B. Linear programming [J]. Operations Research, 50: 42-47, 2002.Cottle R, Johnson E, Wets R. George B. Dantzig (1914-2005) [J]. Notices of the AMS, 54: 344-362, 2007.Kuhn H W. Being in the right place at the right time [J]. Operations Research, 50: 132-134, 2002.Bland R G, Goldfarb D, Todd M J. The ellipsoid method: a survey [J]. Operations Research, 29: 1039-1091, 1981.Karmarkar N. A new polynomial-time algorithm for linear programming [C]//Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, New York: ACM, 1984, 302-311.中国科学技术协会. 运筹学学科发展报告 [M]. 北京: 中国科学技术出版社, 2014.Robert E. Bixby. Solving real-world linear programs: a decade and more of progress [J]. Operations Research, 2002, 50: 3-15.Robert E. Bixby. Solving real-world linear programs: a decade and more of progress [J]. Operations Research, 2002, 50: 3-15.管梅谷. 奇偶点图上作业法 [J]. 数学学报, 1960, 10: 263-266.Yue M, Han J. On the sequencing problem of flow shop [C]//Proceedings of the Seventh IFORS International Conference on Operational Research, 1976.Yue M, Han J. New reduced gradient method [J]. Scientia Sinica, 1979, 22: 1099-1113.Yu W. Positive basis and a class of direct search techniques [J]. Scientia Sinica, Special Issue of Mathematics, 1979, 1: 53-67.Hong C S, Zheng Q. Integral Global Optimization: Theory, Implementation and Applications [M]. Berlin: Springer-Verlag, 1988. |