麻省理工学院“开放式课程网页” | 史隆管理学院 | 15.099 2003秋季课程：最优化书报讨论

下面列出学生的课堂陈述，这些是课堂讨论的基础。相关阅读材料的全部出处在阅读材料网页可以看到。
Student presentations, which form the basis for class discussions, are available below. Full citations for the related readings can be found on the readings page.

课	课程单元
1	最大截；半定规划；和Goemans-Williamson的论文，〈使用半定规划求解最大截问题和可满足性问题的改良近似算法〉 MAXCUT; Semidefinite Programming; and the Goemans-Williamson Paper, "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming." Rob Freund提供的报告（PDF）。这个摘要报告基于文章：Goemans, Michel X.和David P. Williamson.〈使用半定规划求解最大截问题和可满足问题的改良近似算法〉，《ACM期刊》42, no. 6 (November 1995): 1115-45. Presentation courtesy of Rob Freund (PDF). This is a summary presentation based on: 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的文章，〈解决线性规划的简单多项式时间重变化算法〉 Dunagan and Vempala Paper, "Simple Polynomial-Time Rescaling Algorithm for Solving Linear Programs." Dunagan, John, and 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 and Price的文章，〈差值进化法-一种简单有效的在连续空间上全优化的启发式方法〉 Storn and Price Paper, "Differential Evolution - A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces." David Craft提供的报告，获得授权使用（PDF）。这个摘要报告基于Storn, Rainer和Kenneth Price的文章，〈差值进化法-一种简单有效的在连续空间上全优化的启发式方法〉，《全优化期刊》11 (1997): 341-59. Presentation courtesy of David Craft. Used with permission (PDF). This is a summary presentation based on: 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的文章，〈小维度情况下线性和整数规划的Las Vegas算法〉 Clarkson Paper, "Las Vegas Algorithms for Linear and Integer Programming When the Dimension Is Small." Susan Martonosi提供的报告，获得授权使用（PDF）。这个摘要报告基于Clarkson, Kenneth L.的文章〈小维度情况下线性和整数规划的Las Vegas算法〉，《ACM期刊》42期，no. 2 (March 1995): 488-99. Presentation courtesy of Susan Martonosi. Used with permission (PDF). This is a summary presentation based on: 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 and Raghavan，《随机化算法》第九章 Motwani and Raghavan, Chapter 9 in Randomized Algorithms. Jan De Mot提供的报告，获得授权使用（PDF）。这个摘要报告基于Motwani, Rajeev和Prabhakar Raghavan所写的《随机化算法》第九章。剑桥，英国：剑桥大学出版社，1995. ISBN: 0-521-47465-5. Presentation courtesy of Jan De Mot. Used with permission (PDF). This is a summary presentation based on: 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 Paper #1, "A Subexponential Randomized Simplex Algorithm." Kalai的论文#2，〈线性规划、简单型法和简单多面体〉 Kalai Paper #2, "Linear Programming, the Simplex Algorithm and Simple Polytopes." Dan Stratila的提供报告，获得授权使用（PDF）。这个摘要报告基于两篇文章：Kalai, Gil.〈一种亚指数随机化的简单型法〉，《第24届计算理论的机器计算年会公报》，纽约，NY:ACM 出版，1992。和Kalai, Gil.〈线性规划，简单型法和简单多面体〉，耶路撒冷，以色列：耶路撒冷希伯来大学，May 1997. Both presentations courtesy of Dan Stratila. Used with permission (PDF). This is a summary presentation based on two papers: 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. and, Kalai, Gil. "Linear Programming, the Simplex Algorithm and Simple Polytopes." Jerusalem, Israel: Hebrew University of Jerusalem, May 1997.
5	Solis and Wets的文章，〈使用随机搜索技术的最小化〉 Solis and Wets Paper, "Minimization by Random Search Techniques." Michele Aghassi提供的报告，获得授权使用（PDF）。这个摘要报告基于Solis, F. J.和R. J-B. Wets.的文章，〈使用随机搜索技术的最小化〉，《数学运筹学》6 (1981): 19-30. Presentation courtesy of Michele Aghassi. Used with permission (PDF). This is a summary presentation based on: Solis, F. J., and R. J-B. Wets. "Minimization by Random Search Techniques." Mathematical Operations Research 6 (1981): 19-30. Romeijn的论著，〈随机漫步取样方法的全优化〉 Romeijn Thesis Book, "Global Optimization by Random Walk Sampling Methods."
6	Zabinsky and Smith的论文，〈全优化中的纯适应性搜索〉 Zabinsky and Smith Paper, "Pure Adaptive Search in Global Optimization." Michael Yee提供的报告，获得授权使用（PDF）。这个摘要报告基于Zabinsky, Zelda B.和Robert L. Smith的文章，〈全化中的纯适应性搜索〉，《数学规划》55 (1992): 323-38。 Presentation courtesy of Michael Yee. Used with permission (PDF). This is a summary presentation based on: Zabinsky, Zelda B., and Robert L. Smith. "Pure Adaptive Search in Global Optimization." Mathematical Programming 55 (1992): 323-38. Michael Yee和Kwong-Meng Teo提供的报告，获得授权使用（PDF）。这个摘要报告基于Zabinsky, Zelda B.和Robert L. Smith.的文章，〈全优化中的纯适应性搜索〉，《数学规划》55 (1992): 323-38。 Presentation courtesy of Michael Yee and Kwong-Meng Teo. Used with permission (PDF). This is a summary presentation based on: Zabinsky, Zelda B., and Robert L. Smith. "Pure Adaptive Search in Global Optimization." Mathematical Programming 55 (1992): 323-38.
7	Simonovits的论文，〈如何计算高维的容积？〉 Simonovits Paper, "How to Compute the Volume in High Dimension?"
8	Romeijn and Smith的论文，〈限制全优化的模拟退火算法〉 Romeijn and Smith Paper, "Simulated Annealing for Constrained Global Optimization."
9	Bertsimas and Vempala的论文，〈用随机漫步法解决凸型规划〉 Bertsimas and Vempala Paper, "Solving Convex Programs by Random Walks." Zabinsky, Smith, etc.的论文，〈改良全优化的打带跑算法〉　 Zabinsky, Smith, etc. Paper, "Improving Hit-and-Run for Global Optimization."
10	abinsky, Graesser, etc.的论文，〈改良打带跑算法以解决复合材料层合板的全优化问题〉 Zabinsky, Graesser, etc. Paper, "Global Optimization of Composite Laminates Using Improving Hit and Run." Sanjeev的文章，〈求解NP-hard几何最优化问题的近似方案：综述〉 Sanjeev Paper, "Approximation Schemes for NP-hard Geometric Optimization Problems: A Survey."