Methods and models for logistics - (5 cfu)
|Prof. Lorenzo Nicolodi||Tel. 0521-032321 - Fax. 0521-032350|
| ||E-mail. firstname.lastname@example.org|
| ||Home page. http://www.unipr.it/~lnicolo9/|
This 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.
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.
Discussion and solution of exercises and assignments.
Written and oral exam.
an introduction to Linear Programming
Notes by the instructor.
G.L. Nemhauser, L. A. Wolsey, Integer and Combinatorial Optimization, Wiley.
Ultimo aggiornamento: 07-01-2004