Optimization
Methods
·ประกาศคะแนนสอบกลางภาค
ประกาศงดเรียนในวันศุกร์ที่
16 พย 50 นี้
Final
Examination:
Place: Eng. 4, 19-16, Time: 9.00-12.00 (6 March, 2009) Open
Book !!!
The slides used in the course:
- 1st week
- slide no.1:
Introduction to optimization problems slide
no 1
- 2nd week
- 3rd-4th weeks
- 5th week
- 6-7th weeks
- slide no.5: The
theory of valid inequalities slide no 5
- 8th week
- Midterm Examination
(scope--slide no.1, no.5)
Place: Eng. 3-215, Time:
13.00-16.00 (21 July,2003)
Open Book!!!
- 9th week
- slide
no.6: Strong valid
inequalities and facets for
structured integer programming
- Introduction
to duality and relaxation
- Lagrangian relaxation and duality slide no 6
- 10-11th weeks
- slide
no.7: Introduction to general
algorithms
- Branch-and-bound
using linear programming relaxations slide
no 7 (additional sheets about the dual simplex algorithm additional slide A)
- slide no.8: Fractional cutting plane algorithm slide no 8
- 12th week
- slide
no.9: Introduction to
special-purpose algorithms
- A
cutting-plane algorithm using strong valid inequalities
- Decomposition
algorithms slide no 9 (additional
sheets about subgradient additional slide B)
- 13-14th weeks
- 15th week
- slide no.11:
Introduction to approximation algorithm slide
no 11
- 16th week
Text Books:
- G.Nemhauser
and L.Wolsey, Integer and Combinatorial
Optimization, A Wiley-Interscience Pub.
(MAIN TEXT)
- L.Wolsey, Integer Programming,
A Wiley-Interscience Pub.
- C.Papadimitriou
and K. Steiglitz., Combinatorial Optimization:
Algorithms and Complexity, Dover Pub.
- V.Vazirani, Approximation
Algorithms, Springer.