Renata Mansini - Citegraph

Author Info

Name	Affiliation	Papers
RENATA MANSINI	University of Brescia, Department of Electronics for Automation, via Branze 38, 25123 Brescia, Italy	41
Collaborators	Citations	PageRank
32	574	43.10
Referers	Referees	References
1009	568	463

Search Limit

1001000

Publications (41 rows)

Collaborators (32 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem	0	0.34	2022
A Core-Based Exact Algorithm For The Multidimensional Multiple Choice Knapsack Problem	0	0.34	2020
Optimizing the physician scheduling problem in a large hospital ward	0	0.34	2020
The Multi-visit Team Orienteering Problem with Precedence Constraints	0	0.34	2020
Enhanced index tracking with CVaR-based ratio measures	0	0.34	2020
A branch-and-bound algorithm for the time-Dependent rural postman problem.	1	0.35	2019
A Branch-And-Cut Algorithm For The Team Orienteering Problem	1	0.35	2018
The generalized independent set problem: Polyhedral analysis and solution approaches.	3	0.44	2017
The directed profitable rural postman problem with incompatibility constraints.	0	0.34	2017
Mixed integer linear programming models for optimal crop selection.	3	0.44	2017
The Hierarchical Mixed Rural Postman Problem.	4	0.39	2017
The Traveling Purchaser Problem and its variants.	10	0.64	2017
The Traveling Purchaser Problem with time-dependent quantities.	3	0.38	2017
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm.	2	0.35	2017
The Stochastic and Dynamic Traveling Purchaser Problem	4	0.39	2016
Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem.	10	0.58	2016
The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach.	11	0.52	2016
The distance constrained multiple vehicle traveling purchaser problem.	8	0.47	2014
New results for the Directed Profitable Rural Postman Problem.	3	0.37	2014
Twenty years of linear programming based portfolio optimization.	32	1.09	2014
An effective matheuristic for the capacitated total quantity discount problem	7	0.46	2014
An exact algorithm for the Capacitated Total Quantity Discount Problem.	14	0.67	2012
The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search.	55	1.40	2012
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem	21	0.70	2012
Kernel Search: a new heuristic framework for portfolio selection	12	0.65	2012
Look-ahead heuristics for the dynamic traveling purchaser problem	11	0.56	2011
Kernel search: A general heuristic for the multi-dimensional knapsack problem	35	1.10	2010
Comparison of policies in dynamic routing problems	4	0.42	2010
On the effectiveness of scenario generation techniques in single-period portfolio optimization	15	0.88	2009
A Two-Period Portfolio Selection Model for Asset-backed Securitization	0	0.34	2009
The traveling purchaser problem with budget constraint	14	0.66	2009
Conditional value at risk and related linear programming models for portfolio optimization	56	3.12	2007
Securitization of Financial Assets: Approximation in Theory and Practice	2	0.48	2004
Scheduling groups of tasks with precedence constraints on three dedicated processors	4	0.53	2004
On LP Solvable Models for Portfolio Selection	22	1.89	2003
Semi-Absolute Deviation Rule for Mutual Funds Portfolio Selection	11	0.91	2003
An efficient fully polynomial approximation scheme for the Subset-Sum problem	35	4.56	2003
Selecting Portfolios with Fixed Costs and Minimum Transaction Lots	50	4.11	2000
Two linear approximation algorithms for the subset-sum problem	10	0.63	2000
Heuristic algorithms for the portfolio selection problem with minimum transaction lots	94	9.49	1999
A linear programming model for the separate refuse collection service	7	0.73	1998