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.

Multidimensional Multiple-Choice Knapsack Problem

MMKP

R. Mansini, R. Zanotti. A Core-Based Exact Algorithm for the Multidimensional Multiple-Choice Knapsack Problem. INFORMS Journal on Computing (to appear).

Benchmark instances     Detailed Results


  • A Two-phase Kernel Search variant for the Multidimensional Multiple-choice Knapsack Problem

  • Multi Visit Team Orienteering Problem with Precedence Constraints

  • Optimizing the Daily Schedule of a Wellness Center

  • Stochastic Traveling Purchaser Problem

    STPP

    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

    Benchmark instances


    Generalized Independent Set Problem

    GISP

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

    Benchmark instances


    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.

    Benchmark instances

    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.

    Benchmark instances


    Directed Profitable Rural Postman Problem

    DPRPP

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

    Benchmark instances     Detailed results


    Capacitated Total Quantity Discount Problem

    CTQDP

    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.

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

    Benchmark instances     File format


    Multi-Dimensional Knapsack Problem

    MDKP

    Angelelli E., R. Mansini, M.G. Speranza. Kernel search: A general heuristic for the multi-dimensional knapsack problem. Computers & Operations Research 37:2017-2026. 2010.

    Benchmark instances