The course is aimed at providing students with the basic techniques
and algorithms of integer programming and combinatorial optimization as
applied to some relevant problems in logistics.
A basic course in Linear Programming.
Course contents summary
1. Elements of Integer Programming and Combinatorial Optimization
Review on Linear Programming. Integer Linear Programming: formulation
techniques for integer programming problems. Exact algorithms for
the solution of integer programming and combinatorial problems: cutting
plane methods; branch and bound; dynamic programming. Lower and upper
bounds for the optimum: Lagrangian relaxation and Lagrangian duality.
Heuristic methods: greedy techniques, local search techniques, improvement
heuristics, savings algorithm.
2. Applications to logistics
Location problems: plant and facility location models. Distribution
problems: transportation problems; distribution problems; the Vehicle
Routing problem; the Travelling Salesman Problem. Scheduling problems.
Fischetti M., Lezioni di ricerca operativa, Edizioni Libreria Progetto, Padova, 1999.
Sassano A., Metodi e algoritmi della ricerca operativa, Franco Angeli, Milano, 1999.
Ghiani G., Musmanno R., Modelli e metodi per l’organizzazione dei sistemi logistici, Pitagora Editrice, Bologna, 2000.
L. A. Wolsey, Integer Programming, Wiley-Interscience, 1998