default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlfredo Torrico
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Omar El Housni, Alfredo Torrico, Ulysse Hennebelle:
Adaptivity Gaps in Two-Sided Assortment Optimization. IPCO 2024: 139-153- [i10]Omar El Housni, Alfredo Torrico, Ulysse Hennebelle:
Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms. CoRR abs/2403.08929 (2024) - [i9]Alfredo Torrico, Natthawut Boonsiriphatthanajaroen, Nikhil Garg, Andrea Lodi, Hugo Mainguy:
Equitable Congestion Pricing under the Markovian Traffic Model: An Application to Bogota. CoRR abs/2407.05035 (2024) - [i8]Ignacio Rios, Federico Bobbio, Margarida Carvalho, Alfredo Torrico:
Stable Matching with Contingent Priorities. CoRR abs/2409.04914 (2024) - 2023
- [c5]Federico Bobbio
, Margarida Carvalho, Andrea Lodi, Ignacio Rios, Alfredo Torrico:
Capacity Planning in Stable Matching: An Application to School Choice. EC 2023: 295 - 2022
- [j4]Alfredo Torrico, Alejandro Toriello:
Dynamic Relaxations for Online Bipartite Matching. INFORMS J. Comput. 34(4): 1871-1884 (2022) - [i7]Federico Bobbio, Margarida Carvalho, Andrea Lodi, Alfredo Torrico:
Capacity Variation in the Many-to-one Stable Matching. CoRR abs/2205.01302 (2022) - 2021
- [j3]Alfredo Torrico, Mohit Singh, Sebastian Pokutta, Nika Haghtalab, Joseph (Seffi) Naor, Nima Anari:
Structured Robust Submodular Maximization: Offline and Online Algorithms. INFORMS J. Comput. 33(4): 1590-1607 (2021) - [c4]Sebastian Perez-Salazar, Alfredo Torrico, Victor Verdugo:
Preserving Diversity when Partitioning: A Geometric Approach. EAAMO 2021: 15:1-15:11 - [i6]Sebastian Perez-Salazar, Alfredo Torrico, Victor Verdugo:
Preserving Diversity when Partitioning: A Geometric Approach. CoRR abs/2107.04674 (2021) - [i5]Federico Bobbio, Margarida Carvalho, Andrea Lodi, Alfredo Torrico:
Capacity Expansion in the College Admission Problem. CoRR abs/2110.00734 (2021) - 2020
- [c3]Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness. ICML 2020: 7772-7782 - [i4]Alfredo Torrico, Mohit Singh, Sebastian Pokutta:
On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness. CoRR abs/2002.04063 (2020) - [i3]Alfredo Torrico, Margarida Carvalho, Andrea Lodi:
Provable Guarantees for General Two-sided Sequential Matching Markets. CoRR abs/2006.04313 (2020)
2010 – 2019
- 2019
- [b1]Alfredo Torrico Palacios:
Resource Allocation and Subset Selection: New Approaches at the Interface between discrete and continuous Optimization. Georgia Institute of Technology, Atlanta, GA, USA, 2019 - [c2]Nima Anari, Nika Haghtalab, Seffi Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Structured Robust Submodular Maximization: Offline and Online Algorithms. AISTATS 2019: 3128-3137 - 2018
- [j2]Alfredo Torrico, Shabbir Ahmed, Alejandro Toriello:
A polyhedral approach to online bipartite matching. Math. Program. 172(1-2): 443-465 (2018) - [i2]Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Efficient algorithms for robust submodular maximization under matroid constraints. CoRR abs/1807.09405 (2018) - 2017
- [i1]Nima Anari, Nika Haghtalab, Joseph Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Robust Submodular Maximization: Offline and Online Algorithms. CoRR abs/1710.04740 (2017) - 2016
- [j1]Roberto Cominetti, Alfredo Torrico:
Additive Consistency of Risk Measures and Its Application to Risk-Averse Routing in Networks. Math. Oper. Res. 41(4): 1510-1521 (2016) - [c1]Alfredo Torrico, Shabbir Ahmed, Alejandro Toriello:
A Polyhedral Approach to Online Bipartite Matching. IPCO 2016: 287-299
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-10-10 22:16 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:
