Imperial College London

DrDarioPaccagnan

Faculty of EngineeringDepartment of Computing

Lecturer in Department of Computing
 
 
 
//

Contact

 

d.paccagnan Website

 
 
//

Location

 

Electrical EngineeringSouth Kensington Campus

//

Summary

 

Operations Research - COMP60016

Aims

This module will give you the opportunity to:

  • explore quantitative mathematical methods for taking decisions in the presence of constraints or finite resources
  • learn about linear programming, integer linear programming, robust optimisation, and game theory and their application
  • classify mathematical programs on the basis of the number and types of their solutions
  • implement solution techniques for linear programs with both real and integer-valued variables
  • familiarise yourself with fundamental notions of duality, degeneracy, and sensitivity

Role

Course Leader

Scheduling and Resource Allocation - COMP97160

Aims

Real-life problems arising in computer science, computational management and economics often involve deciding the best way to use a given set of resources (e.g., servers, networks, routes) to complete a desired set of tasks within constraints (e.g., costs, deadline). Examples include job scheduling, workflow allocation, traffic routing, business processes optimization. The module blends methods from optimization, scheduling, and game theory to teach the best decision algorithms for such problems. Emphasis will be given to understand the trade-offs between cooperative and competitive approaches, both in centralized and decentralized decision making.

Role

Course Leader

Operations Research - COMP96025

Aims

This module will give you the opportunity to:

  • explore quantitative mathematical methods for taking decisions in the presence of constraints or finite resources
  • learn about linear programming, integer linear programming, robust optimisation, and game theory and their application
  • classify mathematical programs on the basis of the number and types of their solutions
  • implement solution techniques for linear programs with both real and integer-valued variables
  • familiarise yourself with fundamental notions of duality, degeneracy, and sensitivity

Role

Course Leader

Scheduling and Resource Allocation - COMP97159

Aims

Real-life problems arising in computer science, computational management and economics often involve deciding the best way to use a given set of resources (e.g., servers, networks, routes) to complete a desired set of tasks within constraints (e.g., costs, deadline). Examples include job scheduling, workflow allocation, traffic routing, business processes optimization. The module blends methods from optimization, scheduling, and game theory to teach the best decision algorithms for such problems. Emphasis will be given to understand the trade-offs between cooperative and competitive approaches, both in centralized and decentralized decision making.

Role

Course Leader