Cod Esame INQ0091561 CFU 9 Ore Tot 72 ZOOM link Fischetti's classroom: https://unipd.zoom.us/j/364970024 This course is an introduction to Operations Research. Some of the basic topics of Operations Research and Mathematical Optimization are considered: Linear Programming, Integer Linear Programming, and Graph Theory. Particular emphasis is given to Integer Linear Programming, with an exposition of the most recent resolution techniques, and in particular of the branch-and-cut method. Topics: Linear Programming: models and geometry, the simplex algorithm (in matrix and tableau form), revised and dual simplex algorithms. Integer Linear Programming: cutting plane, branch-and-bound and branch-and-cut algorithms. Graph Theory: Definitions. Polynomially solvable problems: shortest spanning tree, shortest path and CPM, network flow. Models for NP-complete problems: knapsack, travelling salesman, set covering and packing, Steiner tree, and plant location problems. Exam: Written examination. Textbook (covering the whole course): M. Fischetti, Introduction to Mathematical Optimization, available through Amazon at https://www.amazon.it/dp/1692792024