15.099 | Fall 2003 | Graduate

Readings in Optimization

Lecture Notes

I. Integer programming part of Clarkson-paper; II. Incremental Linear Programming, Section 9.10.1 in Randomized Algorithms-book

Description:

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(2), March 1995, pp. 488-499. Preliminary version in Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, 1988. and Chapter 9 of: Motwani, Rajeev, and Prabhakar Raghavan. Randomized Algorithms. Cambridge, UK: Cambridge University Press, 1995.

Resource Type:
Lecture Notes
pdf
222 kB
I. Integer programming part of Clarkson-paper; II. Incremental Linear Programming, Section 9.10.1 in Randomized Algorithms-book

Course Info

Instructor
As Taught In
Fall 2003
Level
Learning Resource Types
Lecture Notes
Presentation Assignments with Examples