Home Contact Admin

OR@DII - Operational Research at Department of Information Engineering

Simple Ideas Are Often The Best                                                                                                                                        University of Brescia



Contacts

Operational Research Group
Dip. di Ingegneria dell'Informazione
via Branze, 38
(25123) Brescia
Italy

Telephone:
+39 030 371 5448
+39 030 371 5935


Since 2007, OR@DII is the Operational Reserch group working at the Department of Information Engineering (DII) of the University of Brescia. Its research activity is focused on the development of optimization models and algorithms. OR@DII is part of OR@BRESCIA, the interdepartmental Operational Research group of the University of Brescia.
Filter by type:       Filter by topic:      

2017

P. Beraldi, M. E. Bruni, D. Manerba, R. Mansini. A Stochastic Programming approach for the Traveling Purchaser Problem. IMA Journal of Management Mathematics 28(1) pp 41-63. 2017.   >> Download


D. Manerba, R. Mansini, J. Riera-Ledesma. The Traveling Purchaser Problem and its Variants. European Journal of Operational Research 259 (1), pp. 1-18. 2017.  >> Download


2016

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


D. Manerba, R. Mansini, The Nurse Routing Problem with Workload Constraints and Incompatible Services, IFAC-PapersOnLine 49 (12), pp. 1192-1197. 2016.  >> Download


Angelelli E., Mansini R., Vindigni M. The Stochastic and Dynamic Traveling Purchaser Problem. Transportation Science 50(2), 642 - 658. 2016.   >> Download


D. Manerba, R. Mansini. A Nurse Routing Problem with operational side-constraints. VeRoLog2016. June 6-8, 2016. Nantes, France.


2015

D. Manerba, R. Mansini. A branch-and-cut algorithm for the Multi-vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints. Networks 65(2), pp. 139-154. 2015.   >> Download


D. Manerba. Optimization models and algorithms for problems in Procurement Logistics. 4OR - A Quarterly Journal of Operations Research 13(3). pp. 339-340. 2015  >> Download


M. Gendreau, D. Manerba, R. Mansini. Introducing incompatibility restrictions among products in a multi-vehicle procurement and routing context. NOW 2015 - Network Optimization Workshop. May, 18-21, 2015. La Rochelle, France.


2014

M. Gendreau, D. Manerba, R. Mansini. A branch-and-price algorithm for the Multi-Vehicle Travelling Purchaser Problem with Pairwise Incompatibility Constraints and Unitary Demands. AIRO 2014 – Decision Models for Smarter Cities. September 2-5, 2014. Como, Italy.


M. Gendreau, D. Manerba, R. Mansini. A column generation approach for the Multi-Vehicle Travelling Purchaser Problem with Pairwise Incompatibility Constraints. IFORS. July 13-18,2014. Barcellona, Spain.


D Manerba, M Gendreau, R Mansini. The Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints and Unitary Demands: A Branch-and-Price Approach. CIRRELT-2014-52, CIRRELT. 2014.  >> Download


Bianchessi N., Mansini R., Speranza M.G., (2014). The Distance Constrained Multiple Vehicle Traveling Purchaser Problem. European Journal of Operational Research (ISSN:0377-2217), Vol. 235(1), p. 73-87.


2013

D. Manerba, R. Mansini. Multi-Vehicle Traveling Purchaser Problem with Exclusionary Side Constraints. VeRoLog2013. July, 7-10, 2013. Southampton, England.


D. Manerba, R. Mansini. The Multi-Vehicle Traveling Purchaser Problem with Exclusionary Side Constraints. Presented during “VRP2013: European Spring School on Vehicle Routing” poster session. May, 2013. Angers, France.


2012

D. Manerba, R. Mansini, M. Picchi. Vehicle Purchaser Problem with Exclusionary Side Constraints. AIRO 2012 - Graph Algorithms and Optimization. September 4-7, 2012. Vietri sul Mare (SA), Italy.


P. Beraldi, M. E. Bruni, D. Manerba, R. Mansini. The Traveling Purchaser Problem under Uncertainty. AIRO 2012 - Graph Algorithms and Optimization. September 4-7, 2012. Vietri sul Mare (SA), Italy.


D. Manerba, R. Mansini. The Capacitated Traveling Purchaser Problem with Total Quantity Discount. ODYSSEUS 2012 - 5th International Workshop on Freight Transportation and Logistics, May 21-25, 2012. Mykonos, Greece.


Mansini R., Savelsbergh M.W.P., Tocchella B. (2012). The supplier selection problem with quantity discounts and truckload shipping. OMEGA (ISSN:0305-0483) Vol. 40, p. 445--455.


Labadie N., Mansini R., Melechovsky J., Wolfler Calvo R. (2012). The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search. European Journal of Operational Research (ISSN:0377-2217) Vol. 220, p. 15-27.


2011

D. Manerba, R. Mansini. An exact algorithm for the Capacitated Total Quantity Discount Problem. AIRO 2011 - Operational Research in Transportation and Logistics. September 6-9, 2011. Brescia, Italy.


Angelelli E., Mansini R., Vindigni M. (2011). Look-ahead heuristics for the dynamic traveling purchaser problem. Computers \& Operations Research (ISSN:0305-0548) Vol. 38, p. 1867--1876.


2010

Angelelli E., Bianchessi N., Mansini R., Speranza M.G. (2010). Comparison of policies in dynamic routing problems. Journal of the Operational Research Society (ISSN:0160-5682) Vol. 61, p. 686-695.


2009

Angelelli E., Mansini R., Vindigni M. (2009). Exploring greedy criteria for the dynamic traveling purchaser problem. Central European Journal of Operations Research (ISSN:1435-246X) Vol. 17, p. 141--158.


Angelelli E., Bianchessi N., Mansini R., Speranza M.G. (2009). Short Term Strategies for a Dynamic Multi-Period Routing Problem. Transportation Research. Part C, Emerging Technologies (ISSN:0968-090X) Vol. 17, p. 106-119.


Mansini, R., Tocchella, B. (2009). The Traveling Purchaser Problem with Budget Constraint. Computers \& Operations Research (ISSN:0305-0548) Vol. 36, p. 2263-2274.


Mansini, R., Tocchella, B. (2009). Effective Algorithms for a Bounded Version of the Uncapacitated TPP. In: L. Bertazzi, M.G. Speranza and J.A. van Nunen, Innovations in Distribution Logistics. Springer, Berlin, p. 267-281.


Angelelli E., Bianchessi N., Mansini R., Speranza M.G. (2009). Management policies in a dynamic multi-period routing problem. In: L. Bertazzi, M.G. Speranza, J.A. van Nunen, Innovations in Distribution Logistics. Springer-Verlag, Berlin, p. 1-15.


2005

Archetti C., Mansini R., Speranza M.G. (2005). Complexity and reducibility of the skip delivery problem. TRANSPORTATION SCIENCE (ISSN:0041-1655) Vol. 39, p. 182--187.


Angelelli E., Mansini R., Speranza M.G. (2005). A real-time vehicle routing model for a courier service problem. In: Klose A., Fleischmann B., Distribution Logistics. Springer, Berlin, p. 87-103.


1998

Mansini, R., Speranza M.G., (1998). A linear programming model for the separate refuse collection service. Computers \& Operations Research (ISSN:0305-0548) Vol. 25, p. 659-673.