Renata Mansini

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 25

Top Topics

Portfolio Optimization

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Int. Trans. Oper. Res.

Publications

Valentina Bonomi, Renata Mansini, Roberto Zanotti
Mediating governance goals with patients and nurses satisfaction: a multi-actor multi-objective problem including fairness. Int. J. Prod. Res. 62 (10) (2024)
Francesco Carrabs, Raffaele Cerulli, Renata Mansini, Lorenzo Moreschini, Domenico Serra
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP. Comput. Oper. Res. 166 (2024)
Jean-François Côté, Renata Mansini, Alice Raffaele
Multi-period time window assignment for attended home delivery. Eur. J. Oper. Res. 316 (1) (2024)
Enrico Angelelli, Renata Mansini, Romeo Rizzi
Solving the probabilistic profitable tour problem on a line. Optim. Lett. 17 (8) (2023)
Alessandro Gobbi, Daniele Manerba, Renata Mansini, Roberto Zanotti
Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand. Int. Trans. Oper. Res. 30 (1) (2023)
Renata Mansini, Roberto Zanotti
Two-phase Kernel Search: An Application to Facility Location Problems with Incompatibilities. ICORES (2022)
Leonardo Lamanna, Renata Mansini, Roberto Zanotti
A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem. Eur. J. Oper. Res. 297 (1) (2022)
Enrico Angelelli, Renata Mansini, Romeo Rizzi
Solving the Probabilistic Profitable Tour Problem on a Tree. CoRR (2022)
Claudio Carnevale, Lucia Sangiorgi, Elena De Angelis, Renata Mansini, Marialuisa Volta
A System of Systems for the Optimal Allocation of Pollutant Monitoring Sensors. IEEE Syst. J. 16 (4) (2022)
Renata Mansini, Roberto Zanotti
A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem. INFORMS J. Comput. 32 (4) (2020)
Renata Mansini, Roberto Zanotti
Optimizing the physician scheduling problem in a large hospital ward. J. Sched. 23 (3) (2020)
Saïd Hanafi, Renata Mansini, Roberto Zanotti
The multi-visit team orienteering problem with precedence constraints. Eur. J. Oper. Res. 282 (2) (2020)
Gianfranco Guastaroba, Renata Mansini, Wlodzimierz Ogryczak, M. Grazia Speranza
Enhanced index tracking with CVaR-based ratio measures. Ann. Oper. Res. 292 (2) (2020)
Tobia Calogiuri, Gianpaolo Ghiani, Emanuela Guerriero, Renata Mansini
A branch-and-bound algorithm for the time-Dependent rural postman problem. Comput. Oper. Res. 102 (2019)
Nicola Bianchessi, Renata Mansini, M. Grazia Speranza
A branch-and-cut algorithm for the Team Orienteering Problem. Int. Trans. Oper. Res. 25 (2) (2018)
Marco Colombi, Renata Mansini, Martin W. P. Savelsbergh
The generalized independent set problem: Polyhedral analysis and solution approaches. Eur. J. Oper. Res. 260 (1) (2017)
Carlo Filippi, Renata Mansini, Elisa Stevanato
Mixed integer linear programming models for optimal crop selection. Comput. Oper. Res. 81 (2017)
Enrico Angelelli, Michel Gendreau, Renata Mansini, Michele Vindigni
The Traveling Purchaser Problem with time-dependent quantities. Comput. Oper. Res. 82 (2017)
Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis
The directed profitable rural postman problem with incompatibility constraints. Eur. J. Oper. Res. 261 (2) (2017)
Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis
The Hierarchical Mixed Rural Postman Problem. Transp. Sci. 51 (2) (2017)
Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm. Eur. J. Oper. Res. 257 (1) (2017)
Daniele Manerba, Renata Mansini, Jorge Riera-Ledesma
The Traveling Purchaser Problem and its variants. Eur. J. Oper. Res. 259 (1) (2017)
Michel Gendreau, Daniele Manerba, Renata Mansini
The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach. Eur. J. Oper. Res. 248 (1) (2016)
Enrico Angelelli, Renata Mansini, Michele Vindigni
The Stochastic and Dynamic Traveling Purchaser Problem. Transp. Sci. 50 (2) (2016)
Gianfranco Guastaroba, Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza
Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem. Eur. J. Oper. Res. 251 (3) (2016)
Daniele Manerba, Renata Mansini
A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks 65 (2) (2015)
Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza
The distance constrained multiple vehicle traveling purchaser problem. Eur. J. Oper. Res. 235 (1) (2014)
Marco Colombi, Renata Mansini
New results for the Directed Profitable Rural Postman Problem. Eur. J. Oper. Res. 238 (3) (2014)
Daniele Manerba, Renata Mansini
An effective matheuristic for the capacitated total quantity discount problem. Comput. Oper. Res. 41 (2014)
Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza
Twenty years of linear programming based portfolio optimization. Eur. J. Oper. Res. 234 (2) (2014)
Enrico Angelelli, Renata Mansini, Maria Grazia Speranza
Kernel Search: a new heuristic framework for portfolio selection. Comput. Optim. Appl. 51 (1) (2012)
Nacima Labadi, Renata Mansini, Jan Melechovský, Roberto Wolfler Calvo
The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search. Eur. J. Oper. Res. 220 (1) (2012)
Daniele Manerba, Renata Mansini
An exact algorithm for the Capacitated Total Quantity Discount Problem. Eur. J. Oper. Res. 222 (2) (2012)
Renata Mansini, Maria Grazia Speranza
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem. INFORMS J. Comput. 24 (3) (2012)
Enrico Angelelli, Renata Mansini, Michele Vindigni
Look-ahead heuristics for the dynamic traveling purchaser problem. Comput. Oper. Res. 38 (12) (2011)
Enrico Angelelli, Renata Mansini, Maria Grazia Speranza
Kernel search: A general heuristic for the multi-dimensional knapsack problem. Comput. Oper. Res. 37 (11) (2010)
Enrico Angelelli, Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza
Comparison of policies in dynamic routing problems. J. Oper. Res. Soc. 61 (4) (2010)
Renata Mansini, Ulrich Pferschy
A Two-Period Portfolio Selection Model for Asset-backed Securitization. Algorithmic Oper. Res. 4 (2) (2009)
Gianfranco Guastaroba, Renata Mansini, Maria Grazia Speranza
On the effectiveness of scenario generation techniques in single-period portfolio optimization. Eur. J. Oper. Res. 192 (2) (2009)
Renata Mansini, Barbara Tocchella
The traveling purchaser problem with budget constraint. Comput. Oper. Res. 36 (7) (2009)
Enrico Angelelli, Renata Mansini, Michele Vindigni
Exploring greedy criteria for the dynamic traveling purchaser problem. Central Eur. J. Oper. Res. 17 (2) (2009)
Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza
Conditional value at risk and related linear programming models for portfolio optimization. Ann. Oper. Res. 152 (1) (2007)
Claudia Archetti, Renata Mansini, Maria Grazia Speranza
Complexity and Reducibility of the Skip Delivery Problem. Transp. Sci. 39 (2) (2005)
Renata Mansini, Ulrich Pferschy
Securitization of Financial Assets: Approximation in Theory and Practice. Comput. Optim. Appl. 29 (2) (2004)
Renata Mansini, Maria Grazia Speranza, Zsolt Tuza
Scheduling groups of tasks with precedence constraints on three dedicated processors. Discret. Appl. Math. 134 (1-3) (2004)
Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza
An efficient fully polynomial approximation scheme for the Subset-Sum Problem. J. Comput. Syst. Sci. 66 (2) (2003)
Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza
On LP Solvable Models for Portfolio Selection. Informatica 14 (1) (2003)
Luca Chiodi, Renata Mansini, Maria Grazia Speranza
Semi-Absolute Deviation Rule for Mutual Funds Portfolio Selection. Ann. Oper. Res. 124 (1-4) (2003)
Renata Mansini, M. Grazia Speranza
A multidimensional knapsack model for asset-backed securitization. J. Oper. Res. Soc. 53 (8) (2002)
Hans Kellerer, Renata Mansini, Maria Grazia Speranza
Two linear approximation algorithms for the subset-sum problem. Eur. J. Oper. Res. 120 (2) (2000)
Hans Kellerer, Renata Mansini, Maria Grazia Speranza
Selecting Portfolios with Fixed Costs and Minimum Transaction Lots. Ann. Oper. Res. 99 (1-4) (2000)
Renata Mansini, Maria Grazia Speranza
Heuristic algorithms for the portfolio selection problem with minimum transaction lots. Eur. J. Oper. Res. 114 (2) (1999)
Renata Mansini, Maria Grazia Speranza
A linear programming model for the separate refuse collection service. Comput. Oper. Res. 25 (7-8) (1998)