Warning! The directory is not yet complete and will be amended until the beginning of the term.
250548 VO Decomposition Techniques in Optimization (2006W)
Decomposition Techniques in Optimization
Labels
Erstmals am Dienstag, 3. Oktober 2006
Details
Language: English
Lecturers
Classes (iCal) - next class is marked with N
- Tuesday 03.10. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 10.10. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 17.10. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 24.10. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 31.10. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 07.11. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 14.11. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 21.11. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 28.11. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 05.12. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 12.12. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 09.01. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 16.01. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 23.01. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
- Tuesday 30.01. 09:00 - 10:30 (ehem. Seminarraum A 1.01)
Information
Aims, contents and method of the course
Assessment and permitted materials
Minimum requirements and assessment criteria
Basic concepts of decomposition techniques in LP, NLP,
DP. Knowledge about decomposition algorithms of solving optimization problems.
DP. Knowledge about decomposition algorithms of solving optimization problems.
Examination topics
The Dantzig-Wolfe decomposition algorithm, Benders decomposition, nonserial dynamic programming, tree decomposition.
Reading list
Conejo A.J., Castillo E., Minguez R., Garcia-Bertrand R. Decomposition techniques in mathematical programming. Springer-Verlag, 2006. Bertele U., Brioschi F. Nonserial dynamic programming. N.Y.: Academic
Press, 1972.
Hicks I.V., Koster A.M.C.A., Kolotoglu E. Branch and Tree Decomposition
Techniques for Discrete Optimization. Tutorials in Operations Research.
INFORMS-New Orleans, 2005.
Press, 1972.
Hicks I.V., Koster A.M.C.A., Kolotoglu E. Branch and Tree Decomposition
Techniques for Discrete Optimization. Tutorials in Operations Research.
INFORMS-New Orleans, 2005.
Association in the course directory
Last modified: Mo 07.09.2020 15:40
techniques in discrete Programming (DP), Nonserial dynamic programming, Tree decomposition for discrete optimization problems.