default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabio Tardella
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j25]Francesco Cesarone
, Manuel Luis Martino, Fabio Tardella:
Mean-Variance-VaR portfolios: MIQP formulation and performance analysis. OR Spectr. 45(3): 1043-1069 (2023)- 2022
- [j24]Satoru Fujishige, Fabio Tardella:
Discrete 2-convex functions. Math. Program. 195(1): 831-854 (2022) - 2021
- [j23]Fabio Bellini, Francesco Cesarone, Christian Colombo, Fabio Tardella:
Risk parity with expectiles. Eur. J. Oper. Res. 291(3): 1149-1163 (2021) - 2020
- [j22]Francesco Cesarone, Andrea Scozzari, Fabio Tardella:
An optimization-diversification approach to portfolio selection. J. Glob. Optim. 76(2): 245-265 (2020) - [j21]Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella:
Discrete Midpoint Convexity. Math. Oper. Res. 45(1): 99-128 (2020)
2010 – 2019
- 2019
- [j20]Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella:
Scaling, proximity, and optimization of integrally convex functions. Math. Program. 175(1-2): 119-154 (2019) - 2018
- [j19]Éric Balandraud, Fabio Tardella, Maurice Queyranne:
Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations. Comb. 38(1): 29-41 (2018) - [j18]Andrea Scozzari, Fabio Tardella:
Complexity of some graph-based bounds on the probability of a union of events. Discret. Appl. Math. 244: 186-197 (2018) - [c5]Esteban Salgado, Andrea Scozzari, Fabio Tardella, Leo Liberti:
Alternating Current Optimal Power Flow with Generator Selection. ISCO 2018: 364-375 - 2017
- [j17]Renato Bruni, Francesco Cesarone, Andrea Scozzari, Fabio Tardella:
On exact and approximate stochastic dominance strategies for portfolio selection. Eur. J. Oper. Res. 259(1): 322-329 (2017) - [j16]Francesco Cesarone, Fabio Tardella:
Equal Risk Bounding is better than Risk Parity for portfolio selection. J. Glob. Optim. 68(2): 439-461 (2017) - [j15]Maurice Queyranne, Fabio Tardella:
Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities. Math. Oper. Res. 42(2): 495-516 (2017) - 2016
- [c4]Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella:
Scaling and Proximity Properties of Integrally Convex Functions. ISAAC 2016: 57:1-57:13 - 2015
- [j14]Francesco Cesarone, Andrea Scozzari, Fabio Tardella:
Linear vs. quadratic portfolio selection models with hard real-world constraints. Comput. Manag. Sci. 12(3): 345-370 (2015) - [j13]Renato Bruni, Francesco Cesarone, Andrea Scozzari, Fabio Tardella:
A linear risk-return model for enhanced indexation in portfolio optimization. OR Spectr. 37(3): 735-759 (2015) - 2014
- [j12]Endre Boros, Andrea Scozzari, Fabio Tardella, Pierangela Veneziani:
Polynomially Computable Bounds for the Probability of the Union of Events. Math. Oper. Res. 39(4): 1311-1329 (2014) - 2013
- [j11]Francesco Cesarone, Andrea Scozzari, Fabio Tardella:
A new method for mean-variance portfolio optimization with cardinality constraints. Ann. Oper. Res. 205(1): 213-234 (2013) - [j10]Andrea Scozzari, Fabio Tardella, Sandra Paterlini, Thiemo Krink:
Exact and heuristic approaches for the index tracking problem with UCITS constraints. Ann. Oper. Res. 205(1): 235-250 (2013) - 2012
- [j9]Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella:
Structural and algorithmic properties for parametric minimum cuts. Math. Program. 135(1-2): 337-367 (2012)
2000 – 2009
- 2009
- [j8]Andrea Scozzari, Fabio Tardella:
On the complexity of some subgraph problems. Discret. Appl. Math. 157(17): 3531-3539 (2009) - [c3]Andrea Scozzari, Fabio Tardella:
On the Complexity of Graph-Based Bounds for the Probability Bounding Problem. CTW 2009: 235-238 - 2008
- [j7]Andrea Scozzari, Fabio Tardella:
A clique algorithm for standard quadratic programming. Discret. Appl. Math. 156(13): 2439-2448 (2008) - [j6]Maurice Queyranne, Fabio Tardella:
Sublattices of product spaces: Hulls, representations and counting. Discret. Math. 308(9): 1508-1523 (2008) - [j5]Immanuel M. Bomze, Marco Locatelli, Fabio Tardella:
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. Math. Program. 115(1): 31-64 (2008) - [j4]Fabio Tardella:
Existence and sum decomposition of vertex polyhedral convex envelopes. Optim. Lett. 2(3): 363-375 (2008) - 2004
- [j3]Fabio Tardella:
Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming. Electron. Notes Discret. Math. 17: 257-262 (2004) - [c2]Fabio Tardella:
Connections between Continuous and Combinatorial Optimization Problems through an Extension of the Fundamental Theorem of Linear Programming. CTW 2004: 223-227
1990 – 1999
- 1998
- [j2]Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella:
A General Class of Greedily Solvable Linear Programs. Math. Oper. Res. 23(4): 892-908 (1998) - 1993
- [c1]Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella:
A general class of greedily solvable linear programs. IPCO 1993: 385-399
1980 – 1989
- 1989
- [j1]Fabio Tardella:
On a class of functions attaining their maximum at the vertices of a polyhedron. Discret. Appl. Math. 22(2): 191-195 (1989)
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 2025-01-21 00:16 CET 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:
