Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

--- magistraleinformaticanetworking:mor:start [06/02/2014 alle 14:32 (12 anni fa)] – Maria Grazia Scutellà
+++ magistraleinformaticanetworking:mor:start [19/03/2018 alle 10:15 (8 anni fa)] (versione attuale) – Maria Grazia Scutellà
@@ Linea 9: / Linea 9: @@
 == Objectives ==
-Aim of the course is to present the main modelling techniques and the main algorithmic methodologies for managing communication networks, both at design and at operational level.
+The aim of the course is to present the main modelling techniques and the main algorithmic methodologies for managing communication networks, both at the design and at the operational level.
 Specifically, we describe modelling techniques and algorithmic approaches, for basic and NP-Hard problems, and we apply them to relevant design and operational problems in communication networks, such as QoS routing problems, location problems, and resiliency and robustness problems.
@@ Linea 16: / Linea 16: @@
 == Orario delle lezioni ==
 ^ Giorno ^ Orario ^ Aula ^
-| Martedì | 14--16 | N1 |
+| Martedì | 11--13 | N1 |
-| Giovedì | 14--16 | L1 |
+| Giovedì | 11--13 | N1 |
+== Lesson timetable ==
+^ Day ^ Time ^ Room ^
+| Tuesday | 11--13 | N1 |
+| Thursday | 11--13 | N1 |
 == Orario di ricevimento ==
@@ Linea 23: / Linea 28: @@
 | Mercoledì | 14:30--17:30 | Studio docente |
 |  | su appuntamento | via e-mail |
+== Question time ==
+^ Day ^ Time ^ Room ^
+| Wednesday | 14:30--17:30 | Teacher office |
+|  | by appointment | via e-mail |
@@ Linea 74: / Linea 84: @@
 ===Testi di riferimento (textbooks) ===
-  * R.K. Ahuja, T.L. Magnanti, J.B. Orlin. //Network flows. Theory, algorithms and applications//, Prentice Hall, New Jersey, 1993. //Chapters to study//: Chapters 1, 2, 3 (3.5), 6, 7 (7.1, 7.2, 7.4, 7.6), 9 (9.1, 9.3 (Negative cycle optimality conditions and Reduced cost optimality conditions), 9.6, 9.7), 17 (17.1, 17.3 (no Theorem 17.1), 17.4 (until page 664, rows 1-8), 17.5, 17.6, 17.7 (until page 677 included))
+  * R.K. Ahuja, T.L. Magnanti, J.B. Orlin. //Network flows. Theory, algorithms and applications//, Prentice Hall, New Jersey, 1993. //Chapters to study//: Chapters 1, 2, 3 (3.5), 9 (9.1, 9.3 (Negative cycle optimality conditions and Reduced cost optimality conditions), 9.6, 9.7), 17 (17.1, 17.3 (no Theorem 17.1), 17.4 (until page 664, rows 1-8), 17.5, 17.6, 17.7 (until page 677 included))
   * L.A. Wolsey. //Integer Programming//, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1998. //Chapters to study//: Chapters 1, 2, 7 (except 7.5), 8 (except 8.7 and 8.8), 10
   * M. Pioro, D. Medhi. //Routing, Flow and Capacity Design in Communication and Computer Networks//, Elsevier, 2004. //Chapters to study//: Chapters 4 (4.1, 4.2, 4.3, 4.4 (no proofs of NP-Completeness)), 6 (6.1, 6.3.2, 6.3.3, 6.3.4 (except model D/TNLLP2), 6.3.5 (just to read), 6.4.1), 7 (7.1, 7.2.1, 7.3.1), 9 (9.1, 9.2, 9.3 (except formulations at pages 370 and 375), 9.4 (9.4.1,9.4.2,9.4.3,9.4.4(until constraints (9.4.6)),9.4.5,9.4.6)), 10 (10.1.1, 10.1.4, 10.2.1)
+   === Registro delle lezioni (2014/2015) ===
+** [[http://unimap.unipi.it/registri/dettregistriNEW.php?re=153424::::&ri=6447|Registro di MOR]]**
@@ Linea 106: / Linea 122: @@
-=== Registro delle lezioni ===
-** [[http://unimap.unipi.it/registri/dettregistriNEW.php?re=67976::::&ri=4291|Registro di Metodi di ottimizzazione delle reti]]**