|
|
 |
|
| 1 |
最大截；半定规划； 和Goemans-Williamson的论文。
MAXCUT; Semidefinite Programming; and the Goemans-Williamson Paper |
Goemans, Michel X.和David P. Williamson.〈使用半定规划求解最大截问题和可满足问题的改良近似算法〉，《ACM期刊》42，no. 6 (November 1995)： 1115-45。
Goemans, Michel X., and David P. Williamson. "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming." Journal of the ACM 42, no. 6 (November 1995): 1115-45. |
| 2 |
Dunagan和Vempala的论文；Storn和Price的论文。
Dunagan and Vempala Paper; Storn and Price Paper |
Dunagan, John和 Santosh Vempala.〈解决线性规划的简单多项式时间重变化算法〉，《第36届计算理论的机器计算年会公报》，纽约，NY：ACM 出版，2004。
Dunagan, John, and Santosh Vempala. "A Simple Polynomial-Time Rescaling Algorithm for Solving Linear Programs." In Proceedings of the 36th Annual Association for Computing Machinery Symposium on Theory of Computing. New York, NY: ACM Press, 2004.
Storn, Rainer和Kenneth Price的文章〈差值进化法-一种简单有效的在连续空间上全优化的启发式方法〉，《全优化期刊》11 (1997)：341-59。
Storn, Rainer, and Kenneth Price. "Differential Evolution - A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces." Journal of Global Optimization 11 (1997): 341-59. |
| 3 |
Clarkson的论文；Motwani和Raghavan的著作第9章。
Clarkson Paper; Motwani and Raghavan chapter 9 |
Clarkson, Kenneth L.〈小维度情况下线性和整数规划的Las Vegas算法〉，《ACM期刊》 42期，no. 2 (March 1995)：488-99。
Clarkson, Kenneth L. "Las Vegas Algorithms for Linear and Integer Programming When the Dimension Is Small." Journal of the ACM 42, no. 2 (March 1995): 488-99.
Motwani, Rajeev, and Prabhakar Raghavan.《随机化算法》第九章。剑桥，英国：剑桥大学出版社，1995。ISBN：0-521-47465-5。
Motwani, Rajeev, and Prabhakar Raghavan. Chapter 9 in Randomized Algorithms. Cambridge, UK: Cambridge University Press, 1995. ISBN: 0-521-47465-5. |
| 4 |
Kalai的论文#1；Kalai的论文#2
Kalai Paper #1; Kalai Paper #2 |
Kalai, Gil. 〈一种亚指数随机化的简单型法（扩展摘要）〉，《第24届计算理论的机器计算年会公报》，纽约，NY：ACM 出版，1992。
Kalai, Gil. "A Subexponential Randomized Simplex Algorithm (Extended Abstract)." In Proceedings of the 24th Annual Association for Computing Machinery Symposium on Theory of Computing. New York, NY: ACM Press, 1992.
Kalai, Gil. 〈线性规划、简单型算法和简单多面体〉，耶路撒冷，以色列：耶路撒冷希伯来大学，May 1997。
Kalai, Gil. "Linear Programming, the Simplex Algorithm and Simple Polytopes." Jerusalem, Israel: Hebrew University of Jerusalem, May 1997. |
| 5 |
Solis和Wets的论文；Romeijn的论著
Solis and Wets Paper; Romeijn Thesis Book |
Solis, F. J., and R. J-B. Wets.〈使用随机搜索技术的最小化〉，《数学运筹学》6 (1981)：19-30。
Solis, F. J., and R. J-B. Wets. "Minimization by Random Search Techniques." Mathematical Operations Research 6 (1981): 19-30.
Romeijn,H. Edwin.，〈随机漫步取样方法的全优化〉，阿姆斯特丹：论文出版社，1992
Romeijn, H. Edwin. "Global Optimization by Random Walk Sampling Methods." Amsterdam: Thesis Publishers, 1992. |
| 6 |
Zabinsky和Smith的论文
Zabinsky and Smith Paper |
Zabinsky, Zelda B.和Robert L. Smith.〈全优化中的纯适应性搜索〉，《数学规划》55 (1992)：323-38。
Zabinsky, Zelda B., and Robert L. Smith. "Pure Adaptive Search in Global Optimization." Mathematical Programming 55 (1992): 323-38. |
| 7 |
Simonovits的论文
Simonovits Paper |
Simonovits, Miklós，〈如何计算高维的容积？〉，《数学规划》 B 97 (2003)：337-74。
Simonovits, Miklós. "How to Compute the Volume in High Dimension?" Mathematical Programming B 97 (2003): 337-74. |
| 8 |
Romeijn和Smith的论文
Romeijn and Smith Paper |
Romeijn, H. Edwin和Robert L. Smith，〈限制全优化的模拟退火算法〉，《全优化期刊》 5 (1994): 101-26.
Romeijn, H. Edwin, and Robert L. Smith. "Simulated Annealing for Constrained Global Optimization." Journal of Global Optimization 5 (1994): 101-26. |
| 9 |
Bertsimas和Vempala的论文；Zabinsky, Smith等人的论文
Bertsimas and Vempala Paper; Zabinsky, Smith, etc. Paper |
Bertsimas, Dimitris, and Santosh Vempala.，〈用随机漫步法解决凸型规划〉，《第34届计算理论的机器计算年会公报》，纽约，NY：ACM 出版，2002。
Bertsimas, Dimitris, and Santosh Vempala. "Solving Convex Programs by Random Walks." In Proceedings of the 34th Annual Association for Computing Machinery Symposium on the Theory of Computing. New York, NY: ACM Press, 2002.
Zabinsky, Smith, etc.的论文，〈改良全优化的Hit-and-Run算法〉，《全优化期刊》3 (1993)：171-92。
Zabinsky, Zelda B., Robert L. Smith, J. Fred McDonald, H. Edwin Romeijn, and David E. Kaufman. "Improving Hit-and-Run for Global Optimization." Journal of Global Optimization 3 (1993): 171-92. |
| 10 |
Zabinsky, Graesser等人的论文；Sanjeev的论文。
Zabinsky, Graesser, etc. Paper; Sanjeev Paper |
Zabinsky, Zelda B., D. L. Graesser, M. E. Tuttle和G. I. Kim.〈改良打带跑算法以解决复合材料层合板的全优化问题〉，选自《全优化的新近进展》，由Christodoulos A. Floudas和Panos M. Pardalos编辑，普林斯顿大学出版社，1992，ISBN：0-691-08740-7。
Zabinsky, Zelda B., D. L. Graesser, M. E. Tuttle, and G. I. Kim. "Global Optimization of Composite Laminates Using Improving Hit and Run." In Recent Advances in Global Optimization, edited by Christodoulos A. Floudas and Panos M. Pardalos, 343-68. Princeton University Press, 1992. ISBN: 0-691-08740-7.
Arora, Sanjeev.，〈求解NP-hard几何最优化问题的近似方案：综述〉，《数学规划》B 97 (2003)：43-69。
Arora, Sanjeev. "Approximation Schemes for NP-hard Geometric Optimization Problems: A Survey." Mathematical Programming B 97 (2003): 43-69. |
|
|
|
|
|
