Renata Mansini

According to our database1, Renata Mansini authored at least 46 papers between 1998 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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
Optimizing the physician scheduling problem in a large hospital ward.
J. Sched., 2020

A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem.
INFORMS J. Comput., 2020

The multi-visit team orienteering problem with precedence constraints.
Eur. J. Oper. Res., 2020

Enhanced index tracking with CVaR-based ratio measures.
Ann. Oper. Res., 2020

2019
A branch-and-bound algorithm for the time-Dependent rural postman problem.
Comput. Oper. Res., 2019

2018
A branch-and-cut algorithm for the Team Orienteering Problem.
Int. Trans. Oper. Res., 2018

2017
The Hierarchical Mixed Rural Postman Problem.
Transp. Sci., 2017

The Traveling Purchaser Problem and its variants.
Eur. J. Oper. Res., 2017

The generalized independent set problem: Polyhedral analysis and solution approaches.
Eur. J. Oper. Res., 2017

The directed profitable rural postman problem with incompatibility constraints.
Eur. J. Oper. Res., 2017

The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm.
Eur. J. Oper. Res., 2017

Mixed integer linear programming models for optimal crop selection.
Comput. Oper. Res., 2017

The Traveling Purchaser Problem with time-dependent quantities.
Comput. Oper. Res., 2017

2016
The Stochastic and Dynamic Traveling Purchaser Problem.
Transp. Sci., 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
Twenty years of linear programming based portfolio optimization.
Eur. J. Oper. Res., 2014

New results for the Directed Profitable Rural Postman Problem.
Eur. J. Oper. Res., 2014

The distance constrained multiple vehicle traveling purchaser problem.
Eur. J. Oper. Res., 2014

An effective matheuristic for the capacitated total quantity discount problem.
Comput. Oper. Res., 2014

2012
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem.
INFORMS J. Comput., 2012

An exact algorithm for the Capacitated Total Quantity Discount Problem.
Eur. J. Oper. Res., 2012

The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search.
Eur. J. Oper. Res., 2012

Kernel Search: a new heuristic framework for portfolio selection.
Comput. Optim. Appl., 2012

2011
Look-ahead heuristics for the dynamic traveling purchaser problem.
Comput. Oper. Res., 2011

2010
Comparison of policies in dynamic routing problems.
J. Oper. Res. Soc., 2010

Kernel search: A general heuristic for the multi-dimensional knapsack problem.
Comput. Oper. Res., 2010

2009
On the effectiveness of scenario generation techniques in single-period portfolio optimization.
Eur. J. Oper. Res., 2009

The traveling purchaser problem with budget constraint.
Comput. Oper. Res., 2009

Exploring greedy criteria for the dynamic traveling purchaser problem.
Central Eur. J. Oper. Res., 2009

A Two-Period Portfolio Selection Model for Asset-backed Securitization.
Algorithmic Oper. Res., 2009

2007
Conditional value at risk and related linear programming models for portfolio optimization.
Ann. Oper. Res., 2007

2005
Complexity and Reducibility of the Skip Delivery Problem.
Transp. Sci., 2005

2004
Scheduling groups of tasks with precedence constraints on three dedicated processors.
Discret. Appl. Math., 2004

Securitization of Financial Assets: Approximation in Theory and Practice.
Comput. Optim. Appl., 2004

2003
An efficient fully polynomial approximation scheme for the Subset-Sum Problem.
J. Comput. Syst. Sci., 2003

On LP Solvable Models for Portfolio Selection.
Informatica, 2003

Semi-Absolute Deviation Rule for Mutual Funds Portfolio Selection.
Ann. Oper. Res., 2003

2002
A multidimensional knapsack model for asset-backed securitization.
J. Oper. Res. Soc., 2002

2000
Two linear approximation algorithms for the subset-sum problem.
Eur. J. Oper. Res., 2000

Selecting Portfolios with Fixed Costs and Minimum Transaction Lots.
Ann. Oper. Res., 2000

1999
Heuristic algorithms for the portfolio selection problem with minimum transaction lots.
Eur. J. Oper. Res., 1999

1998
A linear programming model for the separate refuse collection service.
Comput. Oper. Res., 1998


  Loading...