Teaching - Università Roma Tre

MODELS AND ALGORITHMS FOR OPTIMIZATION (objectives)

Code

20810252

Language

ITA

Type of certificate

Profit certificate

Credits

6

Scientific Disciplinary Sector Code

MAT/09

Contact Hours

54

Type of Activity

Related or supplementary learning activities

Derived from	20801957 OPERATIONAL RESEARCH II in Computer science and engineering L-8 N0 NICOSIA GAIA (syllabus) Decision making process. Introduction to Integer Linear Programming (ILP): relation between ILP and LP, equivalent formulations, relaxations, totally unimodular matrices, standard techniques for ILP modelling. Typical ILP formulations: plant location, investment problem, sequencing problems, network optimization, transportation problems, set covering, set partitioning, set packing, crew scheduling. Exact algorithms: Branch and Bound, Cutting Planes, dynamic programming. Exact algorithms for binary and integer knapsack problems. Optimization on graphs: matching, vertex cover, max flow, independent set, Eulerian graphs and bipartite graphs. Use of an ILP commercial solver. (reference books) [1] M. FISCHETTI, "LEZIONI DI RICERCA OPERATIVA", EDIZIONI LIBRERIA PROGETTO PADOVA, ITALIA, 1995. (CAP. 2, 5, PARTE DEL 6 E DEL 7). [2] R. AHUJA, T. MAGNANTI, J. ORLIN, "NETWORK FLOWS", PRENTICE HALL, 1993. (PG. 189-191, 473-475, 494-496) [3] Lecture notes
Dates of beginning and end of teaching activities	From 01/03/2023 to 12/06/2023
Delivery mode	Traditional
Attendance	not mandatory
Evaluation methods	Written test Oral exam