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:      

2019

D. Manerba, G. Perboli. New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty. Computers & Operations Research 101, pp. 29-42. 2019.  >> Download


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


Bianchessi, N., Mansini, R., Speranza. A branch-and-cut algorithm for the Team Orienteering Problem. International Transactions in Operational Research 25(2), pp. 627-635.  >> Download


D. Manerba, R. Mansini, R. Zanotti. Attended Home Delivery: reducing last-mile environmental impact by changing customer habits. IFAC-PapersOnLine 51 (5), 55-60. 2018.  >> Download


M. Pasetti, S. Rinaldi, D. Manerba. A Virtual Power Plant Architecture for the Demand-Side Management of Smart Prosumers. Applied Sciences 8 (3), 432. 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


Colombi, M., Mansini, R., Savelsbergh, M. The generalized independent set problem: Polyhedral analysis and solution approaches. European Journal of Operational Research 260(1), pp. 41-55.  >> Download


Colombi, M., Corberán, Á., Mansini, R., Plana, I., Sanchis, J.M. The directed profitable rural postman problem with incompatibility constraints. European Journal of Operational Research 261(2), pp. 549-562  >> Download


Angelelli, E., Gendreau, M., Mansini, R., Vindigni, M.The Traveling Purchaser Problem with time-dependent quantities. Computers and Operations Research 82, pp. 15-26.  >> Download


Filippi, C., Mansini, R., Stevanato, E. Mixed integer linear programming models for optimal crop selection. Computers and Operations Research 81, pp. 26-39  >> Download


Saccani, N., Visintin, F., Mansini, R., Colombi, M. Improving spare parts management for field services: A model and a case study for the repair kit problem. IMA Journal of Management Mathematics 28(2), pp. 185-204.  >> Download


Colombi, M., Corberán, Á., Mansini, R., Plana, I., Sanchis, J.M. The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm. European Journal of Operational Research 257(1), pp. 1-12  >> Download


Colombi, M., Corberán, Á., Mansini, R., Plana, I., Sanchis, J.M. The hierarchical mixed rural postman problem. Transportation Science 51(2), pp. 755-770.  >> 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


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


Guastaroba G., Mansini R., Ogryczak W., Speranza M.G. Linear Programming Models based on Omega Ratio for the Enhanced Index Tracking Problem. European Journal of Operational Research 251 (3), pp. 938-956. 2016   >> Download


Colombi M., Corberan A., Mansini R., Plana I., Sanchis J.M. The Hierarchical Mixed Rural Postman Problem. Transportation Science 51 (2), 755-770. 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


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.


Mansini R., Ogryczak W., Speranza M.G. (2015). Linear and Mixed Integer Programming for Portfolio Optimization. EURO Advanced Tutorials on Operational Research, Vol. 1, Springer, ISBN 978-3-319-18482-1.


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


Mansini R., Ogryczak W., Speranza M.G. (2014). Twenty Years of Linear Programming Based Portfolio Optimization. European Journal of Operational Research (ISSN:0377-2217), Vol. 234, p. 518--535.


Colombi M., Mansini R., (2014). New results for the Directed Profitable Rural Postman Problem. European Journal of Operational Research (ISSN:0377-2217), Vol. 238(3), p. 760--773.


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., Speranza M.G. (2012). CORAL: An exact algorithm for the Multidimensional Knapsack Problem. INFORMS Journal on Computing (ISSN:1526-5528) Vol. 24, p. 399-415.


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.


Angelelli E., Mansini R., Speranza M.G. (2012). Kernel Search: A new heuristic framework for portfolio selection. Computational Optimization and Applications (ISSN:0926-6003) Vol. 51, p. 345--361.


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., Mansini R., Speranza M.G. (2010). Kernel Search: A general heuristic for the Multi-dimensional Knapsack Problem. Computers \& Operations Research (ISSN:0305-0548) Vol. 37, p. 2017--2026.


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

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.


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., Pferschy U. (2009). A Two-Period Portfolio Selection Model for Asset-backed Securitization. Algorithmic Operations Research (ISSN:1718-3235) Vol. 4(2), p. 155--170.


Guastaroba G., Mansini R., Speranza M.G. (2009). On the effectiveness of scenario generation techniques in single-period portfolio optimization. European Journal of Operational Research (ISSN:0377-2217) Vol. 192, p. 500--511.


Guastaroba G., Mansini R., Speranza M.G. (2009). Models and simulations for portfolio rebalancing. Computational Economics (ISSN:0927-7099) Vol. 33, p. 237-262.


Guastaroba G., Mansini R., Speranza M.G. (2009). Modeling the pre-auction stage: the truckload case. In: L. Bertazzi, M.G. Speranza, J.A. van Nunen, Innovations in Distribution Logistics. Springer, Berlin, p. 219-233.


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


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.


2008

Angelelli E., Mansini R., Speranza M.G. (2008). A comparison of MAD and CVaR with side constraints. Journal of Banking \& Finance (ISSN:0378-4266) Vol. 32, 1188-1197.


2007

Mansini R., Ogryczak W., Speranza M.G. (2007). Conditional value at risk and related linear programming models for portfolio optimization. Annals of Operations Research (ISSN:0254-5330), Vol. 152, p. 227--256.


2005

Mansini R., Speranza M.G. (2005). An exact approach for portfolio selection with transaction costs and rounds. IIE TRANSACTIONS (ISSN:0740-817X) Vol. 37, p. 919--929.


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.


2004

Mansini R., Pferschy U. (2004). Securitization of Financial Assets: Approximation in Theory and Practice. Computational Optimization and Applications (ISSN:0926-6003) Vol. 29, p. 147--171.


Mansini R., Speranza M.G., Tuza Z. (2004). Scheduling groups of tasks with precedence constraints on three dedicated processors. Discrete Applied Mathematics (ISSN:0166-218X) Vol. 134, p. 141-168.


2003

Chiodi L., Mansini R., Speranza M.G. (2003). Semi-absolute deviation rule for mutual funds portfolio selection. Annals of Operations Research (ISSN:0254-5330) Vol. 124, p. 245-265.


Kellerer, H., Mansini R., Pferschy U., Speranza M.G. (2003). An efficient fully polynomial approximation scheme for the subset-sum problem. Journal of Computer and System Sciences (ISSN:0022-0000) Vol. 66(2), p. 349-370.


Mansini R., Ogryczak W., Speranza M.G. (2003). LP solvable models for portfolio optimization: a classification and computational comparison. IMA Journal of Management Mathematics (ISSN:1471-678X) Vol. 14, p. 187--220.


Mansini R., Ogryczak W., Speranza M.G. (2003). On LP solvable models for portfolio selection. Informatica (ISSN:0350-5596) Vol. 14(1), p. 37-62.


2002

Mansini, R., Speranza M.G., (2002). Multidimensional Knapsack Model for the Selection of Contracts in an Asset-Backed Securitization. Journal of the Operational Research Society (ISSN:0160-5682) Vol. 53, p. 822-832.


2000

Kellerer, H., Mansini, R., Speranza M.G., (2000). Selecting portfolios with fixed costs and minimum transaction lots. Annals of Operations Research (ISSN:0254-5330) Vol. 99, p. 287-304.


Kellerer H., Mansini R. , Speranza M.G. (2000). Two Linear Approximation Algorithms for the Subset-Sum Problem. European Journal of Operational Research (ISSN:0377-2217) Vol. 120, p. 289--296.


1999

Mansini R., Speranza M.G. (1999). Heuristic Algorithms for the Portfolio Selection Problem with Minimum Transaction Lots. European Journal of Operational Research (ISSN:0377-2217) Vol. 114(2), p. 219--233.


Mansini, R., Speranza M.G., (1999). Selection of Lease Contracts in an Asset-Backed Securitization: a Real Case Analysis. Control and Cybernetics (ISSN:0324-8569) Vol. 28(4), p. 739-754.


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.


1997

Mansini, R., Speranza M.G., (1997). Effective linear programming based heuristics for a portfolio selection problem. Ricerca Operativa (ISSN:0390-8127) p. 5-23.