OPTIMIZATION METHODS FOR ICT 2025-2026 - INQ2100739

Section outline

• Select section INQ2100739 - OPTIMIZATION METHODS FOR ICT 2025-2026 - R. ROBERTI

  Collapse Expand

  INQ2100739 - OPTIMIZATION METHODS FOR ICT 2025-2026 - R. ROBERTI

  Collapse all Expand all

  Teacher

  Roberto Roberti (roberto.roberti@unipd.it)

  Textbook

  Ahuja, Ravindra K.; Magnanti, Thomas L.; Orlin, Jams B., Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, New Jersey: Prentice Hall, 1993. AmazonLink (or Google it to get the pdf)

  Lectures (starting on October 2nd, 2025)

  • Thursday, from 12:30 to 14:15, room Oe (Polo Didattico di Via Gradenigo)
  • Friday, from 8:40 to 10:15, room Pe (Polo Didattico di Via Gradenigo)

  Lecture Notes

  The lecture notes will be available after the lectures in the corresponding topic section below

  Office Hours

  By appointment (Building DEI/G, 4th floor, Via Gradenigo 4/B)

  Exam

  Final written exam

  Exam Dates

  • Monday, January 19th, 2026, from 9:30 to 12:30, room Ce
  • Thursday, February 19th, 2026, from 9:30 to 12:30, room Ce
  • Monday, June 29th, 2026, from 9:30 to 12:30, room Ee
  • Friday, September 18th, 2026, from 9:30 to 12:30, room Pe

  • Select activity Announcements

    

    Announcements Forum
  • Select activity Course Description Study Plan

    

    Course Description Study Plan URL
  • Select activity Lecture Notes

    

    Lecture Notes File PDF

    5.1 MB · Uploaded 7/12/25, 07:12
• Select section 1. Introduction

  Collapse Expand

  1. Introduction

  • Select activity Notes - Introduction

    

    Notes - Introduction File PDF

    471.9 KB · Uploaded 3/10/25, 10:49
• Select section 2. Linear Programming

  Collapse Expand

  2. Linear Programming

  • Select activity Notes - Linear Programming

    

    Notes - Linear Programming File PDF

    729.8 KB · Uploaded 16/10/25, 16:42
• Select section 3. Paths, Trees, and Cycles

  Collapse Expand

  3. Paths, Trees, and Cycles

  • Select activity Notes - Path Trees and Cycles

    

    Notes - Path Trees and Cycles File PDF

    1.2 MB · Uploaded 24/10/25, 12:35
• Select section 4. Shortest Paths

  Collapse Expand

  4. Shortest Paths

  • Select activity Notes - Shortest Paths

    

    Notes - Shortest Paths File PDF

    695.8 KB · Uploaded 6/11/25, 17:15
• Select section 5. Maximum Flows

  Collapse Expand

  5. Maximum Flows

  • Select activity Notes - Maximum Flows

    

    Notes - Maximum Flows File PDF

    1.0 MB · Uploaded 14/11/25, 10:28
• Select section 6. Minimum Spanning Trees

  Collapse Expand

  6. Minimum Spanning Trees

  • Select activity Notes - Minimum Spanning Trees

    

    Notes - Minimum Spanning Trees File PDF

    1.1 MB · Uploaded 27/11/25, 14:59
• Select section 7. Minimum Cost Flows

  Collapse Expand

  7. Minimum Cost Flows

  • Select activity Notes - Min-Cost Flows

    

    Notes - Min-Cost Flows File PDF

    491.7 KB · Uploaded 7/12/25, 07:13