- Docente: Paolo Toth
- Credits: 4
- Language: English
- Teaching Mode: Traditional lectures
- Campus: Bologna
- Corso: Second cycle degree programme (LM) in Computer Engineering (cod. 0937)
Learning outcomes
At the end of the project work, the students are able to apply the techniques acquired in the Algorithms for combinatorial optimization problems m course to implement effective algorithms for determining the optimal solution of a Combinatorial Optimization problem, and to analyze the corresponding computational performance.
Course contents
Definition of mathematical models, design of effective exact algorithms, and implementation of the corresponding codes for the optimal solution of a Combinatorial Optimization problem.
Readings/Bibliography
S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations, J. Wiley, 1990.
G. Gutin, A. Punnen (editors), The Traveling Salesman Problem and Its Variations, Kluwer, 2002.
C. Barnhart, G. Laporte (editors), Transportation, Handbooks in Operations Research and Management Science, North Holland, 2007.
Wiley Encyclopedia in Operations Research and Management Science, Wiley, 2011.
P. Toth, D. Vigo (editors), Vehicle Routing: Problems, Methods and Applications, MOS-SIAM Series on Optimization, 2014.
Teaching methods
Definition of mathematical models, design of effective exact algorithms, and implementation of the corresponding codes for the optimal solution of a Combinatorial Optimization problem.
Assessment methods
Experimental evaluation of the proposed models, algorithms and codes.
Teaching tools
Papers published in international journals concerning the considered optimizatiuon problem.
Office hours
See the website of Paolo Toth