default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefano Benati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Stefano Benati, Eduardo Conde
:
A robust ordered weighted averaging loss model for portfolio optimization. Comput. Oper. Res. 167: 106666 (2024)- [j24]Stefano Benati:
The Marriage Game Revisited: New Insights About Domestic Labor, Divorces and Men's Expectations About Marriage. IGTR 26(3): 2350021:1-2350021:21 (2024) - 2022
- [j23]Stefano Benati, Eduardo Conde:
A relative robust approach on expected returns with bounded CVaR for portfolio selection. Eur. J. Oper. Res. 296(1): 332-352 (2022) - [j22]Stefano Benati, Diego Ponce, Justo Puerto, Antonio M. Rodríguez-Chía:
A branch-and-price procedure for clustering data that are graph connected. Eur. J. Oper. Res. 297(3): 817-830 (2022) - 2021
- [j21]Stefano Benati, Giuseppe Vittucci Marzetti:
Voting power on a graph connected political space with an application to decision-making in the Council of the European Union. Soc. Choice Welf. 57(4): 733-761 (2021)
2010 – 2019
- 2019
- [j20]Stefano Benati, Fernando López-Blázquez, Justo Puerto:
A stochastic approach to approximate values in cooperative games. Eur. J. Oper. Res. 279(1): 93-106 (2019) - [i1]Paolo Bartesaghi, Stefano Benati, Gian Paolo Clemente, Rosanna Grassi:
Multi-criteria community detection in International Trade Network. CoRR abs/1911.08593 (2019) - 2018
- [j19]Stefano Benati, Sergio García, Justo Puerto:
Mixed integer linear programming and heuristic methods for feature selection in clustering. J. Oper. Res. Soc. 69(9): 1379-1395 (2018) - 2017
- [j18]Stefano Benati, Justo Puerto, Antonio M. Rodríguez-Chía:
Clustering data that are graph connected. Eur. J. Oper. Res. 261(1): 43-53 (2017) - 2015
- [j17]Stefano Benati:
Using medians in portfolio optimization. J. Oper. Res. Soc. 66(5): 720-731 (2015) - [j16]Stefano Benati, Romeo Rizzi, Craig A. Tovey:
The complexity of power indexes with graph restricted coalitions. Math. Soc. Sci. 76: 53-63 (2015) - 2014
- [j15]Stefano Benati, Sergio García:
A mixed integer linear model for clustering with variable selection. Comput. Oper. Res. 43: 280-285 (2014) - 2013
- [j14]Stefano Benati, Giuseppe Vittucci Marzetti:
Probabilistic spatial power indexes. Soc. Choice Welf. 40(2): 391-410 (2013) - 2011
- [j13]Stefano Benati, Silvana Stefani:
The Academic Journal Ranking Problem: A Fuzzy-Clustering Approach. J. Classif. 28(1): 7-20 (2011) - [j12]Stefano Benati:
Heuristic methods for the optimal statistic median problem. Comput. Oper. Res. 38(1): 379-386 (2011)
2000 – 2009
- 2009
- [j11]Stefano Benati, Romeo Rizzi:
The optimal statistical median of a convex set of arrays. J. Glob. Optim. 44(1): 79-97 (2009) - 2008
- [j10]S. Arifusalem, Stefano Benati, Brian Boffey, Teresa Cáceres, Dietmar Cieslik, Zvi Drezner, Horst A. Eiselt, Ioannis Giannikos, Horst W. Hamacher, John M. Hodgson, Jörg Kalcsics, Kathrin Klamroth, Olivier Klopfenstein, Mercedes Landete, Maria Cruz López de los Mozos Martin, Alfredo Marín, Juan A. Mesa, Malick M. Ndiaye, Stefan Nickel, Blas Pelegrín:
New trends in locational analysis. Comput. Oper. Res. 35(3): 649-650 (2008) - [j9]Stefano Benati:
Categorical data fuzzy clustering: An analysis of local search heuristics. Comput. Oper. Res. 35(3): 766-775 (2008) - 2007
- [j8]Francesco Maffioli, Romeo Rizzi, Stefano Benati:
Least and most colored bases. Discret. Appl. Math. 155(15): 1958-1970 (2007) - [j7]Stefano Benati, Romeo Rizzi:
A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem. Eur. J. Oper. Res. 176(1): 423-434 (2007) - 2006
- [j6]Stefano Benati:
An Optimization Model for Stochastic Project Networks with Cash Flows. Comput. Manag. Sci. 3(4): 271-284 (2006) - 2004
- [j5]Stefano Benati:
The computation of the worst conditional expectation. Eur. J. Oper. Res. 155(2): 414-425 (2004) - 2003
- [j4]Stefano Benati:
An Improved Branch & Bound Method for the Uncapacitated Competitive Location Problem. Ann. Oper. Res. 122(1-4): 43-58 (2003) - [j3]Stefano Benati:
The optimal portfolio problem with coherent risk measure constraints. Eur. J. Oper. Res. 150(3): 572-584 (2003) - 2002
- [j2]Stefano Benati, Pierre Hansen:
The maximum capture problem with random utilities: Problem formulation and algorithms. Eur. J. Oper. Res. 143(3): 518-530 (2002)
1990 – 1999
- 1999
- [j1]Stefano Benati:
The maximum capture problem with heterogeneous customers. Comput. Oper. Res. 26(14): 1351-1367 (1999)
Coauthor Index
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-21 23:34 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:
