A linear programming model for the separate refuse collection service. - Renata Mansini; Maria Grazia Speranza (Comput. Oper. Res., 1998)

Heuristic algorithms for the portfolio selection problem with minimum transaction lots. - Renata Mansini; Maria Grazia Speranza (Eur. J. Oper. Res., 1999)

Selecting Portfolios with Fixed Costs and Minimum Transaction Lots. - Hans Kellerer; Renata Mansini; Maria Grazia Speranza (Ann. Oper. Res., 2000)

Two linear approximation algorithms for the subset-sum problem. - Hans Kellerer; Renata Mansini; Maria Grazia Speranza (Eur. J. Oper. Res., 2000)

A multidimensional knapsack model for asset-backed securitization. - Renata Mansini; M. Grazia Speranza (J. Oper. Res. Soc., 2002)

Semi-Absolute Deviation Rule for Mutual Funds Portfolio Selection. - Luca Chiodi; Renata Mansini; Maria Grazia Speranza (Ann. Oper. Res., 2003)

On LP Solvable Models for Portfolio Selection. - Renata Mansini; Wlodzimierz Ogryczak; Maria Grazia Speranza (Informatica, 2003)

An efficient fully polynomial approximation scheme for the Subset-Sum Problem. - Hans Kellerer; Renata Mansini; Ulrich Pferschy; Maria Grazia Speranza (J. Comput. Syst. Sci., 2003)

Securitization of Financial Assets: Approximation in Theory and Practice. - Renata Mansini; Ulrich Pferschy (Comput. Optim. Appl., 2004)

Scheduling groups of tasks with precedence constraints on three dedicated processors. - Renata Mansini; Maria Grazia Speranza; Zsolt Tuza (Discret. Appl. Math., 2004)

Complexity and Reducibility of the Skip Delivery Problem. - Claudia Archetti; Renata Mansini; Maria Grazia Speranza (Transp. Sci., 2005)

Conditional value at risk and related linear programming models for portfolio optimization. - Renata Mansini; Wlodzimierz Ogryczak; Maria Grazia Speranza (Ann. Oper. Res., 2007)

A Two-Period Portfolio Selection Model for Asset-backed Securitization. - Renata Mansini; Ulrich Pferschy (Algorithmic Oper. Res., 2009)

Exploring greedy criteria for the dynamic traveling purchaser problem. - Enrico Angelelli; Renata Mansini; Michele Vindigni (Central Eur. J. Oper. Res., 2009)

The traveling purchaser problem with budget constraint. - Renata Mansini; Barbara Tocchella (Comput. Oper. Res., 2009)

On the effectiveness of scenario generation techniques in single-period portfolio optimization. - Gianfranco Guastaroba; Renata Mansini; Maria Grazia Speranza (Eur. J. Oper. Res., 2009)

Kernel search: A general heuristic for the multi-dimensional knapsack problem. - Enrico Angelelli; Renata Mansini; Maria Grazia Speranza (Comput. Oper. Res., 2010)

Comparison of policies in dynamic routing problems. - Enrico Angelelli; Nicola Bianchessi; Renata Mansini; Maria Grazia Speranza (J. Oper. Res. Soc., 2010)

Look-ahead heuristics for the dynamic traveling purchaser problem. - Enrico Angelelli; Renata Mansini; Michele Vindigni (Comput. Oper. Res., 2011)

Kernel Search: a new heuristic framework for portfolio selection. - Enrico Angelelli; Renata Mansini; Maria Grazia Speranza (Comput. Optim. Appl., 2012)

The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search. - Nacima Labadi; Renata Mansini; Jan Melechovský; Roberto Wolfler Calvo (Eur. J. Oper. Res., 2012)

An exact algorithm for the Capacitated Total Quantity Discount Problem. - Daniele Manerba; Renata Mansini (Eur. J. Oper. Res., 2012)

CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem. - Renata Mansini; Maria Grazia Speranza (INFORMS J. Comput., 2012)

An effective matheuristic for the capacitated total quantity discount problem. - Daniele Manerba; Renata Mansini (Comput. Oper. Res., 2014)

The distance constrained multiple vehicle traveling purchaser problem. - Nicola Bianchessi; Renata Mansini; Maria Grazia Speranza (Eur. J. Oper. Res., 2014)

New results for the Directed Profitable Rural Postman Problem. - Marco Colombi; Renata Mansini (Eur. J. Oper. Res., 2014)

Twenty years of linear programming based portfolio optimization. - Renata Mansini; Wlodzimierz Ogryczak; Maria Grazia Speranza (Eur. J. Oper. Res., 2014)

A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. - Daniele Manerba; Renata Mansini (Networks, 2015)

The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach. - Michel Gendreau; Daniele Manerba; Renata Mansini (Eur. J. Oper. Res., 2016)

Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem. - Gianfranco Guastaroba; Renata Mansini; Wlodzimierz Ogryczak; Maria Grazia Speranza (Eur. J. Oper. Res., 2016)

The Stochastic and Dynamic Traveling Purchaser Problem. - Enrico Angelelli; Renata Mansini; Michele Vindigni (Transp. Sci., 2016)

The Traveling Purchaser Problem with time-dependent quantities. - Enrico Angelelli; Michel Gendreau; Renata Mansini; Michele Vindigni (Comput. Oper. Res., 2017)

Mixed integer linear programming models for optimal crop selection. - Carlo Filippi; Renata Mansini; Elisa Stevanato (Comput. Oper. Res., 2017)

The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm. - Marco Colombi; Ángel Corberán; Renata Mansini; Isaac Plana; José M. Sanchis (Eur. J. Oper. Res., 2017)

The directed profitable rural postman problem with incompatibility constraints. - Marco Colombi; Ángel Corberán; Renata Mansini; Isaac Plana; José M. Sanchis (Eur. J. Oper. Res., 2017)

The generalized independent set problem: Polyhedral analysis and solution approaches. - Marco Colombi; Renata Mansini; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2017)

The Traveling Purchaser Problem and its variants. - Daniele Manerba; Renata Mansini; Jorge Riera-Ledesma (Eur. J. Oper. Res., 2017)

The Hierarchical Mixed Rural Postman Problem. - Marco Colombi; Ángel Corberán; Renata Mansini; Isaac Plana; José M. Sanchis (Transp. Sci., 2017)

A branch-and-cut algorithm for the Team Orienteering Problem. - Nicola Bianchessi; Renata Mansini; M. Grazia Speranza (Int. Trans. Oper. Res., 2018)

A branch-and-bound algorithm for the time-Dependent rural postman problem. - Tobia Calogiuri; Gianpaolo Ghiani; Emanuela Guerriero; Renata Mansini (Comput. Oper. Res., 2019)

Enhanced index tracking with CVaR-based ratio measures. - Gianfranco Guastaroba; Renata Mansini; Wlodzimierz Ogryczak; M. Grazia Speranza (Ann. Oper. Res., 2020)

The multi-visit team orienteering problem with precedence constraints. - Saïd Hanafi; Renata Mansini; Roberto Zanotti (Eur. J. Oper. Res., 2020)

A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem. - Renata Mansini; Roberto Zanotti (INFORMS J. Comput., 2020)

Optimizing the physician scheduling problem in a large hospital ward. - Renata Mansini; Roberto Zanotti (J. Sched., 2020)

Two-phase Kernel Search: An Application to Facility Location Problems with Incompatibilities. - Renata Mansini; Roberto Zanotti (ICORES, 2022)

Solving the Probabilistic Profitable Tour Problem on a Tree. - Enrico Angelelli; Renata Mansini; Romeo Rizzi (CoRR, 2022)

A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem. - Leonardo Lamanna 001; Renata Mansini; Roberto Zanotti (Eur. J. Oper. Res., 2022)

A System of Systems for the Optimal Allocation of Pollutant Monitoring Sensors. - Claudio Carnevale; Lucia Sangiorgi; Elena De Angelis; Renata Mansini; Marialuisa Volta (IEEE Syst. J., 2022)

Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand. - Alessandro Gobbi; Daniele Manerba; Renata Mansini; Roberto Zanotti (Int. Trans. Oper. Res., 2023)

Solving the probabilistic profitable tour problem on a line. - Enrico Angelelli; Renata Mansini; Romeo Rizzi (Optim. Lett., 2023)

Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP. - Francesco Carrabs; Raffaele Cerulli; Renata Mansini; Lorenzo Moreschini; Domenico Serra (Comput. Oper. Res., 2024)

Multi-period time window assignment for attended home delivery. - Jean-François Côté; Renata Mansini; Alice Raffaele (Eur. J. Oper. Res., 2024)

A learning-based granular variable neighborhood search for a multi-period election logistics problem with time-dependent profits. - Masoud Shahmanzari; Renata Mansini (Eur. J. Oper. Res., 2024)

Mediating governance goals with patients and nurses satisfaction: a multi-actor multi-objective problem including fairness. - Valentina Bonomi; Renata Mansini; Roberto Zanotti (Int. J. Prod. Res., 2024)

Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints. - Francesco Carrabs; Raffaele Cerulli; Renata Mansini; Domenico Serra; Carmine Sorgente (Eur. J. Oper. Res., 2025)

Dynamically dealing with requests in a stochastic multi-period home healthcare problem with consistency constraints. - Valentina Bonomi; Jean-François Côté; Renata Mansini; Roberto Zanotti (Int. J. Prod. Res., 2025)

A multi-level rescheduling approach for a dynamic remote operations scheduling problem. - Annalisa Castelletti; Lorenzo Moreschini; Marzia Corvaglia; Renata Mansini (Int. J. Prod. Res., 2025)