default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRenata Mansini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j52]Francesco Carrabs
, Raffaele Cerulli, Renata Mansini, Lorenzo Moreschini, Domenico Serra:
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP. Comput. Oper. Res. 166: 106620 (2024)- [j51]Jean-François Côté, Renata Mansini, Alice Raffaele:
Multi-period time window assignment for attended home delivery. Eur. J. Oper. Res. 316(1): 295-309 (2024) - [j50]Masoud Shahmanzari, Renata Mansini:
A learning-based granular variable neighborhood search for a multi-period election logistics problem with time-dependent profits. Eur. J. Oper. Res. 319(1): 135-152 (2024) - [j49]Valentina Bonomi, Renata Mansini, Roberto Zanotti:
Mediating governance goals with patients and nurses satisfaction: a multi-actor multi-objective problem including fairness. Int. J. Prod. Res. 62(10): 3753-3780 (2024) - 2023
- [j48]Alessandro Gobbi, Daniele Manerba, Renata Mansini, Roberto Zanotti:
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. 30(1): 8-38 (2023) - [j47]Enrico Angelelli, Renata Mansini, Romeo Rizzi:
Solving the probabilistic profitable tour problem on a line. Optim. Lett. 17(8): 1873-1888 (2023) - 2022
- [j46]Leonardo Lamanna, Renata Mansini, Roberto Zanotti:
A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem. Eur. J. Oper. Res. 297(1): 53-65 (2022) - [j45]Claudio Carnevale, Lucia Sangiorgi, Elena De Angelis, Renata Mansini, Marialuisa Volta:
A System of Systems for the Optimal Allocation of Pollutant Monitoring Sensors. IEEE Syst. J. 16(4): 6393-6400 (2022) - [c1]Renata Mansini, Roberto Zanotti:
Two-phase Kernel Search: An Application to Facility Location Problems with Incompatibilities. ICORES 2022: 105-111 - [i1]Enrico Angelelli, Renata Mansini, Romeo Rizzi:
Solving the Probabilistic Profitable Tour Problem on a Tree. CoRR abs/2210.11881 (2022) - 2020
- [j44]Gianfranco Guastaroba, Renata Mansini, Wlodzimierz Ogryczak, M. Grazia Speranza:
Enhanced index tracking with CVaR-based ratio measures. Ann. Oper. Res. 292(2): 883-931 (2020) - [j43]Saïd Hanafi, Renata Mansini, Roberto Zanotti:
The multi-visit team orienteering problem with precedence constraints. Eur. J. Oper. Res. 282(2): 515-529 (2020) - [j42]Renata Mansini, Roberto Zanotti:
A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem. INFORMS J. Comput. 32(4): 1061-1079 (2020) - [j41]Renata Mansini, Roberto Zanotti:
Optimizing the physician scheduling problem in a large hospital ward. J. Sched. 23(3): 337-361 (2020)
2010 – 2019
- 2019
- [j40]Tobia Calogiuri, Gianpaolo Ghiani, Emanuela Guerriero, Renata Mansini:
A branch-and-bound algorithm for the time-Dependent rural postman problem. Comput. Oper. Res. 102: 150-157 (2019) - 2018
- [j39]Nicola Bianchessi, Renata Mansini, M. Grazia Speranza:
A branch-and-cut algorithm for the Team Orienteering Problem. Int. Trans. Oper. Res. 25(2): 627-635 (2018) - 2017
- [j38]Carlo Filippi, Renata Mansini, Elisa Stevanato:
Mixed integer linear programming models for optimal crop selection. Comput. Oper. Res. 81: 26-39 (2017) - [j37]Enrico Angelelli, Michel Gendreau, Renata Mansini, Michele Vindigni:
The Traveling Purchaser Problem with time-dependent quantities. Comput. Oper. Res. 82: 15-26 (2017) - [j36]Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis:
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm. Eur. J. Oper. Res. 257(1): 1-12 (2017) - [j35]Daniele Manerba, Renata Mansini, Jorge Riera-Ledesma:
The Traveling Purchaser Problem and its variants. Eur. J. Oper. Res. 259(1): 1-18 (2017) - [j34]Marco Colombi, Renata Mansini, Martin W. P. Savelsbergh:
The generalized independent set problem: Polyhedral analysis and solution approaches. Eur. J. Oper. Res. 260(1): 41-55 (2017) - [j33]Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis:
The directed profitable rural postman problem with incompatibility constraints. Eur. J. Oper. Res. 261(2): 549-562 (2017) - [j32]Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis:
The Hierarchical Mixed Rural Postman Problem. Transp. Sci. 51(2): 755-770 (2017) - 2016
- [j31]Michel Gendreau, Daniele Manerba, Renata Mansini:
The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach. Eur. J. Oper. Res. 248(1): 59-71 (2016) - [j30]Gianfranco Guastaroba, Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza:
Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem. Eur. J. Oper. Res. 251(3): 938-956 (2016) - [j29]Enrico Angelelli, Renata Mansini, Michele Vindigni:
The Stochastic and Dynamic Traveling Purchaser Problem. Transp. Sci. 50(2): 642-658 (2016) - 2015
- [j28]Daniele Manerba, Renata Mansini:
A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks 65(2): 139-154 (2015) - 2014
- [j27]Daniele Manerba, Renata Mansini:
An effective matheuristic for the capacitated total quantity discount problem. Comput. Oper. Res. 41: 1-11 (2014) - [j26]Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza:
Twenty years of linear programming based portfolio optimization. Eur. J. Oper. Res. 234(2): 518-535 (2014) - [j25]Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza:
The distance constrained multiple vehicle traveling purchaser problem. Eur. J. Oper. Res. 235(1): 73-87 (2014) - [j24]Marco Colombi, Renata Mansini:
New results for the Directed Profitable Rural Postman Problem. Eur. J. Oper. Res. 238(3): 760-773 (2014) - 2012
- [j23]Enrico Angelelli, Renata Mansini, Maria Grazia Speranza:
Kernel Search: a new heuristic framework for portfolio selection. Comput. Optim. Appl. 51(1): 345-361 (2012) - [j22]Nacima Labadi, Renata Mansini, Jan Melechovský, Roberto Wolfler Calvo:
The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search. Eur. J. Oper. Res. 220(1): 15-27 (2012) - [j21]Daniele Manerba, Renata Mansini:
An exact algorithm for the Capacitated Total Quantity Discount Problem. Eur. J. Oper. Res. 222(2): 287-300 (2012) - [j20]Renata Mansini, Maria Grazia Speranza:
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem. INFORMS J. Comput. 24(3): 399-415 (2012) - 2011
- [j19]Enrico Angelelli, Renata Mansini, Michele Vindigni:
Look-ahead heuristics for the dynamic traveling purchaser problem. Comput. Oper. Res. 38(12): 1867-1876 (2011) - 2010
- [j18]Enrico Angelelli, Renata Mansini, Maria Grazia Speranza:
Kernel search: A general heuristic for the multi-dimensional knapsack problem. Comput. Oper. Res. 37(11): 2017-2026 (2010) - [j17]Enrico Angelelli, Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza:
Comparison of policies in dynamic routing problems. J. Oper. Res. Soc. 61(4): 686-695 (2010)
2000 – 2009
- 2009
- [j16]Renata Mansini, Ulrich Pferschy:
A Two-Period Portfolio Selection Model for Asset-backed Securitization. Algorithmic Oper. Res. 4(2): 155-170 (2009) - [j15]Enrico Angelelli, Renata Mansini, Michele Vindigni:
Exploring greedy criteria for the dynamic traveling purchaser problem. Central Eur. J. Oper. Res. 17(2): 141-158 (2009) - [j14]Renata Mansini, Barbara Tocchella:
The traveling purchaser problem with budget constraint. Comput. Oper. Res. 36(7): 2263-2274 (2009) - [j13]Gianfranco Guastaroba, Renata Mansini, Maria Grazia Speranza:
On the effectiveness of scenario generation techniques in single-period portfolio optimization. Eur. J. Oper. Res. 192(2): 500-511 (2009) - 2007
- [j12]Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza:
Conditional value at risk and related linear programming models for portfolio optimization. Ann. Oper. Res. 152(1): 227-256 (2007) - 2005
- [j11]Claudia Archetti, Renata Mansini, Maria Grazia Speranza:
Complexity and Reducibility of the Skip Delivery Problem. Transp. Sci. 39(2): 182-187 (2005) - 2004
- [j10]Renata Mansini, Ulrich Pferschy:
Securitization of Financial Assets: Approximation in Theory and Practice. Comput. Optim. Appl. 29(2): 147-171 (2004) - [j9]Renata Mansini, Maria Grazia Speranza, Zsolt Tuza:
Scheduling groups of tasks with precedence constraints on three dedicated processors. Discret. Appl. Math. 134(1-3): 141-168 (2004) - 2003
- [j8]Luca Chiodi, Renata Mansini, Maria Grazia Speranza:
Semi-Absolute Deviation Rule for Mutual Funds Portfolio Selection. Ann. Oper. Res. 124(1-4): 245-265 (2003) - [j7]Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza:
On LP Solvable Models for Portfolio Selection. Informatica 14(1): 37-62 (2003) - [j6]Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza:
An efficient fully polynomial approximation scheme for the Subset-Sum Problem. J. Comput. Syst. Sci. 66(2): 349-370 (2003) - 2002
- [j5]Renata Mansini, M. Grazia Speranza:
A multidimensional knapsack model for asset-backed securitization. J. Oper. Res. Soc. 53(8): 822-832 (2002) - 2000
- [j4]Hans Kellerer, Renata Mansini, Maria Grazia Speranza:
Selecting Portfolios with Fixed Costs and Minimum Transaction Lots. Ann. Oper. Res. 99(1-4): 287-304 (2000) - [j3]Hans Kellerer, Renata Mansini, Maria Grazia Speranza:
Two linear approximation algorithms for the subset-sum problem. Eur. J. Oper. Res. 120(2): 289-296 (2000)
1990 – 1999
- 1999
- [j2]Renata Mansini, Maria Grazia Speranza:
Heuristic algorithms for the portfolio selection problem with minimum transaction lots. Eur. J. Oper. Res. 114(2): 219-233 (1999) - 1998
- [j1]Renata Mansini, Maria Grazia Speranza:
A linear programming model for the separate refuse collection service. Comput. Oper. Res. 25(7-8): 659-673 (1998)
Coauthor Index
aka: M. Grazia Speranza
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
