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:      

2018

D. Manerba, R. Mansini, G. Perboli. The Capacitated Supplier Selection Problem with Total Quantity Discount policy and Activation Costs under Uncertainty. International Journal of Production Economics 198, pp. 119-132. 2018.  >> Download


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


D. Manerba, R. Mansini, G. Perboli. Supplier Selection under Uncertainty in the presence of Total Quantity Discounts. ODS2017. September 4-7, 2017. Sorrento, Italy


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


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


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

D. Manerba, R. Mansini. An Effective Matheuristic for the Capacitated Total Quantity Discount Problem. Computers and Operations Research 41(1), pp. 1-11. 2014.  >> Download


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. An Exact Algorithm for the Capacitated Total Quantity Discount Problem. European Journal of Operational Research 222(2) pp. 287-300. 2012.  >> Download


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.


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.


2009

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.