| 02713 Networks & Integer Programming |
| Danish title: Netværk og heltalsprogrammering |
|
Language: English ECTS-creditpoints: 10, External examination.
|
|
|
Exam schedule:
|
F3-A (maj 31 2002) |
| Recommended semester: 4th -7th semester |
| Scope and form: Lectures, exercises and project work. |
Evaluation: Oral exam and approval of reports
Report (50%) and oral exam (50%). |
| Examination: 13-scale |
| Previous course: 04232 |
| Prerequisites: Introductory operations research. |
| Aim: To give students a thorough introduction to formulating and solving network and integer programming problems arising in areas like traffic, transportation, investment, and production planning. Participants are enabled to formulate network and integer programming problems and to apply several simpler optimization methods on them. |
Contents: Linear programming on graphs: review of relevant graph theory. Algorithms for shortest paths, maximal flows in capacitated networks, and minimal cost flows. Planning networks: PERT and
deterministic planning networks. Integer programming: Branch & Bound, Cutting planes, Branch & Cut, Lagrange relaxation. Application examples: project planning, vehicle routing, and production planning. |
| Contact: Jens Clausen, building 305, (+45) 4525 3387, jc@imm.dtu.dk |
| Department: 002 Informatics and Mathematical Modelling |
| Course URL: http://www.imm.dtu.dk/courses/02713 |
| Keywords: Integer Programming, Network Optimization, Cutting Planes, Branch-and-Bound, Branch-and-Cut |
| Updated: 20-04-2001 |
|
|
