Renata Mansini

59 papers C 2Journal 57
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree.
Math. Oper. Res.
Enrico Angelelli, Renata Mansini, Romeo Rizzi
2025 J jnl
A multi-level rescheduling approach for a dynamic remote operations scheduling problem.
Int. J. Prod. Res.
Annalisa Castelletti, Lorenzo Moreschini, Marzia Corvaglia, Renata Mansini
2025 J jnl
Dynamically dealing with requests in a stochastic multi-period home healthcare problem with consistency constraints.
Int. J. Prod. Res.
Valentina Bonomi, Jean-François Côté, Renata Mansini, Roberto Zanotti
2025 J jnl
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints.
Eur. J. Oper. Res.
Francesco Carrabs, Raffaele Cerulli, Renata Mansini, Domenico Serra, Carmine Sorgente
2025 C conf
The price of customer presence in Attended Home Delivery with Customer Availability Profiles.
FedCSIS
Roberto Zanotti, Daniele Manerba, Renata Mansini
2024 J jnl
A learning-based granular variable neighborhood search for a multi-period election logistics problem with time-dependent profits.
Eur. J. Oper. Res.
Masoud Shahmanzari, Renata Mansini
2024 J jnl
Mediating governance goals with patients and nurses satisfaction: a multi-actor multi-objective problem including fairness.
Int. J. Prod. Res.
Valentina Bonomi, Renata Mansini, Roberto Zanotti
2024 J jnl
Multi-period time window assignment for attended home delivery.
Eur. J. Oper. Res.
Jean-François Côté, Renata Mansini, Alice Raffaele
2024 J jnl
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP.
Comput. Oper. Res.
Francesco Carrabs, Raffaele Cerulli, Renata Mansini, Lorenzo Moreschini, Domenico Serra
2023 J jnl
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.
Alessandro Gobbi, Daniele Manerba, Renata Mansini, Roberto Zanotti
2023 J jnl
Solving the probabilistic profitable tour problem on a line.
Optim. Lett.
Enrico Angelelli, Renata Mansini, Romeo Rizzi
2022 J jnl
A System of Systems for the Optimal Allocation of Pollutant Monitoring Sensors.
IEEE Syst. J.
Claudio Carnevale, Lucia Sangiorgi, Elena De Angelis, Renata Mansini, Marialuisa Volta
2022 J jnl
A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem.
Eur. J. Oper. Res.
Leonardo Lamanna, Renata Mansini, Roberto Zanotti
2022 J jnl
Solving the Probabilistic Profitable Tour Problem on a Tree.
CoRR
Enrico Angelelli, Renata Mansini, Romeo Rizzi
2022 C conf
Two-phase Kernel Search: An Application to Facility Location Problems with Incompatibilities.
ICORES
Renata Mansini, Roberto Zanotti
2020 J jnl
A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem.
INFORMS J. Comput.
Renata Mansini, Roberto Zanotti
2020 J jnl
Enhanced index tracking with CVaR-based ratio measures.
Ann. Oper. Res.
Gianfranco Guastaroba, Renata Mansini, Wlodzimierz Ogryczak, M. Grazia Speranza
2020 J jnl
Optimizing the physician scheduling problem in a large hospital ward.
J. Sched.
Renata Mansini, Roberto Zanotti
2020 J jnl
The multi-visit team orienteering problem with precedence constraints.
Eur. J. Oper. Res.
Saïd Hanafi, Renata Mansini, Roberto Zanotti
2019 J jnl
A branch-and-bound algorithm for the time-Dependent rural postman problem.
Comput. Oper. Res.
Tobia Calogiuri, Gianpaolo Ghiani, Emanuela Guerriero, Renata Mansini
2018 J jnl
A branch-and-cut algorithm for the Team Orienteering Problem.
Int. Trans. Oper. Res.
Nicola Bianchessi, Renata Mansini, M. Grazia Speranza
2017 J jnl
Mixed integer linear programming models for optimal crop selection.
Comput. Oper. Res.
Carlo Filippi, Renata Mansini, Elisa Stevanato
2017 J jnl
The Hierarchical Mixed Rural Postman Problem.
Transp. Sci.
Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis
2017 J jnl
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm.
Eur. J. Oper. Res.
Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis
2017 J jnl
The Traveling Purchaser Problem and its variants.
Eur. J. Oper. Res.
Daniele Manerba, Renata Mansini, Jorge Riera-Ledesma
2017 J jnl
The Traveling Purchaser Problem with time-dependent quantities.
Comput. Oper. Res.
Enrico Angelelli, Michel Gendreau, Renata Mansini, Michele Vindigni
2017 J jnl
The directed profitable rural postman problem with incompatibility constraints.
Eur. J. Oper. Res.
Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis
2017 J jnl
The generalized independent set problem: Polyhedral analysis and solution approaches.
Eur. J. Oper. Res.
Marco Colombi, Renata Mansini, Martin W. P. Savelsbergh
2016 J jnl
Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem.
Eur. J. Oper. Res.
Gianfranco Guastaroba, Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza
2016 J jnl
The Stochastic and Dynamic Traveling Purchaser Problem.
Transp. Sci.
Enrico Angelelli, Renata Mansini, Michele Vindigni
2016 J jnl
The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach.
Eur. J. Oper. Res.
Michel Gendreau, Daniele Manerba, Renata Mansini
2015 J jnl
A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints.
Networks
Daniele Manerba, Renata Mansini
2014 J jnl
An effective matheuristic for the capacitated total quantity discount problem.
Comput. Oper. Res.
Daniele Manerba, Renata Mansini
2014 J jnl
New results for the Directed Profitable Rural Postman Problem.
Eur. J. Oper. Res.
Marco Colombi, Renata Mansini
2014 J jnl
The distance constrained multiple vehicle traveling purchaser problem.
Eur. J. Oper. Res.
Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza
2014 J jnl
Twenty years of linear programming based portfolio optimization.
Eur. J. Oper. Res.
Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza
2012 J jnl
An exact algorithm for the Capacitated Total Quantity Discount Problem.
Eur. J. Oper. Res.
Daniele Manerba, Renata Mansini
2012 J jnl
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem.
INFORMS J. Comput.
Renata Mansini, Maria Grazia Speranza
2012 J jnl
Kernel Search: a new heuristic framework for portfolio selection.
Comput. Optim. Appl.
Enrico Angelelli, Renata Mansini, Maria Grazia Speranza
2012 J jnl
The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search.
Eur. J. Oper. Res.
Nacima Labadi, Renata Mansini, Jan Melechovský, Roberto Wolfler Calvo
2011 J jnl
Look-ahead heuristics for the dynamic traveling purchaser problem.
Comput. Oper. Res.
Enrico Angelelli, Renata Mansini, Michele Vindigni
2010 J jnl
Comparison of policies in dynamic routing problems.
J. Oper. Res. Soc.
Enrico Angelelli, Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza
2010 J jnl
Kernel search: A general heuristic for the multi-dimensional knapsack problem.
Comput. Oper. Res.
Enrico Angelelli, Renata Mansini, Maria Grazia Speranza
2009 J jnl
A Two-Period Portfolio Selection Model for Asset-backed Securitization.
Algorithmic Oper. Res.
Renata Mansini, Ulrich Pferschy
2009 J jnl
Exploring greedy criteria for the dynamic traveling purchaser problem.
Central Eur. J. Oper. Res.
Enrico Angelelli, Renata Mansini, Michele Vindigni
2009 J jnl
On the effectiveness of scenario generation techniques in single-period portfolio optimization.
Eur. J. Oper. Res.
Gianfranco Guastaroba, Renata Mansini, Maria Grazia Speranza
2009 J jnl
The traveling purchaser problem with budget constraint.
Comput. Oper. Res.
Renata Mansini, Barbara Tocchella
2007 J jnl
Conditional value at risk and related linear programming models for portfolio optimization.
Ann. Oper. Res.
Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza
2005 J jnl
Complexity and Reducibility of the Skip Delivery Problem.
Transp. Sci.
Claudia Archetti, Renata Mansini, Maria Grazia Speranza
2004 J jnl
Scheduling groups of tasks with precedence constraints on three dedicated processors.
Discret. Appl. Math.
Renata Mansini, Maria Grazia Speranza, Zsolt Tuza
2004 J jnl
Securitization of Financial Assets: Approximation in Theory and Practice.
Comput. Optim. Appl.
Renata Mansini, Ulrich Pferschy
2003 J jnl
An efficient fully polynomial approximation scheme for the Subset-Sum Problem.
J. Comput. Syst. Sci.
Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza
2003 J jnl
On LP Solvable Models for Portfolio Selection.
Informatica
Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza
2003 J jnl
Semi-Absolute Deviation Rule for Mutual Funds Portfolio Selection.
Ann. Oper. Res.
Luca Chiodi, Renata Mansini, Maria Grazia Speranza
2002 J jnl
A multidimensional knapsack model for asset-backed securitization.
J. Oper. Res. Soc.
Renata Mansini, M. Grazia Speranza
2000 J jnl
Selecting Portfolios with Fixed Costs and Minimum Transaction Lots.
Ann. Oper. Res.
Hans Kellerer, Renata Mansini, Maria Grazia Speranza
2000 J jnl
Two linear approximation algorithms for the subset-sum problem.
Eur. J. Oper. Res.
Hans Kellerer, Renata Mansini, Maria Grazia Speranza
1999 J jnl
Heuristic algorithms for the portfolio selection problem with minimum transaction lots.
Eur. J. Oper. Res.
Renata Mansini, Maria Grazia Speranza
1998 J jnl
A linear programming model for the separate refuse collection service.
Comput. Oper. Res.
Renata Mansini, Maria Grazia Speranza