390051 UK PhD-AW: Advanced Optimization (2013W)
Continuous assessment of course work
Labels
Registration/Deregistration
Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).
- Registration is open from Fr 06.09.2013 09:00 to Fr 20.09.2013 14:00
- Registration is open from We 25.09.2013 09:00 to Th 26.09.2013 17:00
- Deregistration possible until Mo 14.10.2013 23:59
Details
max. 24 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
- Tuesday 08.10. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 15.10. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 22.10. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 29.10. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 05.11. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 12.11. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 19.11. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 26.11. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 03.12. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 10.12. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 17.12. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 07.01. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 14.01. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 21.01. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Tuesday 28.01. 08:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
Information
Aims, contents and method of the course
Assessment and permitted materials
Minimum requirements and assessment criteria
Examination topics
Reading list
Association in the course directory
Last modified: Mo 07.09.2020 15:46
Approximation of the completely positive cone using hierarchies.
Modeling combinatorial optimization problems using copositive optimization models.