Renata Mansini
Orcid: 0000-0002-2194-0339
According to our database1,
Renata Mansini
authored at least 54 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Mediating governance goals with patients and nurses satisfaction: a multi-actor multi-objective problem including fairness.
Int. J. Prod. Res., 2024
A learning-based granular variable neighborhood search for a multi-period election logistics problem with time-dependent profits.
Eur. J. Oper. Res., 2024
Eur. J. Oper. Res., 2024
Comput. Oper. Res., 2024
2023
Optim. Lett., November, 2023
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., 2023
2022
IEEE Syst. J., 2022
A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem.
Eur. J. Oper. Res., 2022
Two-phase Kernel Search: An Application to Facility Location Problems with Incompatibilities.
Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022
2020
J. Sched., 2020
A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem.
INFORMS J. Comput., 2020
Eur. J. Oper. Res., 2020
2019
Comput. Oper. Res., 2019
2018
Int. Trans. Oper. Res., 2018
2017
The generalized independent set problem: Polyhedral analysis and solution approaches.
Eur. J. Oper. Res., 2017
Eur. J. Oper. Res., 2017
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm.
Eur. J. Oper. Res., 2017
Comput. Oper. Res., 2017
Comput. Oper. Res., 2017
2016
Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem.
Eur. J. Oper. Res., 2016
The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach.
Eur. J. Oper. Res., 2016
2015
A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints.
Networks, 2015
2014
Eur. J. Oper. Res., 2014
Eur. J. Oper. Res., 2014
Eur. J. Oper. Res., 2014
Comput. Oper. Res., 2014
2012
INFORMS J. Comput., 2012
Eur. J. Oper. Res., 2012
The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search.
Eur. J. Oper. Res., 2012
Comput. Optim. Appl., 2012
2011
Comput. Oper. Res., 2011
2010
Comput. Oper. Res., 2010
2009
On the effectiveness of scenario generation techniques in single-period portfolio optimization.
Eur. J. Oper. Res., 2009
Central Eur. J. Oper. Res., 2009
Algorithmic Oper. Res., 2009
2007
Conditional value at risk and related linear programming models for portfolio optimization.
Ann. Oper. Res., 2007
2005
2004
Scheduling groups of tasks with precedence constraints on three dedicated processors.
Discret. Appl. Math., 2004
Comput. Optim. Appl., 2004
2003
J. Comput. Syst. Sci., 2003
Ann. Oper. Res., 2003
2002
J. Oper. Res. Soc., 2002
2000
Eur. J. Oper. Res., 2000
Ann. Oper. Res., 2000
1999
Heuristic algorithms for the portfolio selection problem with minimum transaction lots.
Eur. J. Oper. Res., 1999
1998
Comput. Oper. Res., 1998