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).

Internal Reports



2016

  • D. Manerba, R. Mansini, J. Riera-Ledesma. The Traveling Purchaser Problem and its Variants. OR@DII-2016-01. OR@DII, University of Brescia. 2016.  >> Download


    • 2013

  • M. Colombi, R. Mansini. The Directed Profitable Rural Postman Problem. OR@DII-2013-01, OR@DII, University of Brescia. 2013.  >> Download

  • D. Manerba, R. Mansini. A branch-and-cut algorithm for the Multi-Vehicle Traveling Purchaser Problem with Exclusionary Side Constraints. OR@DII-2013-02, OR@DII, University of Brescia. 2013.  >> Download


    • 2011

  • D. Manerba, R. Mansini. An effective hybrid heuristic for the Capacitated Total Quantity Discount Problem. RT_2011-03-67, Dept. of Information Engineering, University of Brescia. 2011.  >> Download

  • D. Manerba, R. Mansini. An exact method for the Capacitated Total Quantity Discount Problem. RT_2011-02-66, Dept. of Information Engineering, University of Brescia. 2011.  >> Download


    • 2007

  • R. Mansini, B. Tocchella. The Traveling Purchaser Problem with Budget Constraint. RT_2007-02-54, Dept. of Information Engineering, University of Brescia. 2007.  >> Download