MAO group - Models and Algorithms for Optimization
Dept. of Information Engineering University of Brescia
Contacts
Dip. di Ingegneria dell'Informazione
Universita' degli Studi di Brescia
via Branze, 38
25123, Brescia
Italy
Telephone:
+39 030 371 5448
+39 030 371 5935
+39 030 371 5757
Since 2007, MAO is the Operational Reserch group working at the Department of Information Engineering of the University of Brescia, Italy.
It is part of the inter-departmental group OR@BRESCIA (University of Brescia, Italy).
Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints
MVTPP-PIC
D. Manerba, R. Mansini. A branch-and-cut algorithm for the Multi-vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints. Networks 65(2), 139-154. 2015.
M. Gendreau, D. Manerba, R. Mansini. The Multi-vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints and Unitary Demands: A Branch-and-Price approach. European Journal of Operational Research 248(1), 59-71. 2016.