default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiulia Zarpellon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]A Samuel Pottinger
, Giulia Zarpellon:
Pyafscgap.org: Open source multi-modal Python-based tools for NOAA AFSC RACE GAP. J. Open Source Softw. 8(87): 5593 (2023)- 2022
- [j2]Pierre Bonami, Andrea Lodi, Giulia Zarpellon:
A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX. Oper. Res. 70(6): 3303-3320 (2022) - [c5]Max B. Paulus, Giulia Zarpellon, Andreas Krause, Laurent Charlin, Chris J. Maddison:
Learning to Cut by Looking Ahead: Cutting Plane Selection via Imitation Learning. ICML 2022: 17584-17600 - [i3]Maxime Gasse, Quentin Cappart, Jonas Charfreitag, Laurent Charlin, Didier Chételat, Antonia Chmiela, Justin Dumouchelle, Ambros M. Gleixner, Aleksandr M. Kazachkov, Elias B. Khalil, Pawel Lichocki, Andrea Lodi, Miles Lubin, Chris J. Maddison, Christopher Morris, Dimitri J. Papageorgiou, Augustin Parjadis, Sebastian Pokutta, Antoine Prouvost, Lara Scavuzzo, Giulia Zarpellon, Linxin Yang, Sha Lai, Akang Wang, Xiaodong Luo, Xiang Zhou, Haohan Huang, Sheng Cheng Shao, Yuanming Zhu, Dong Zhang, Tao Quan, Zixuan Cao, Yang Xu, Zhewei Huang, Shuchang Zhou, Binbin Chen, Minggui He, Hao Hao, Zhiyu Zhang, Zhiwu An, Kun Mao:
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. CoRR abs/2203.02433 (2022) - [i2]Max B. Paulus, Giulia Zarpellon, Andreas Krause, Laurent Charlin, Chris J. Maddison:
Learning To Cut By Looking Ahead: Cutting Plane Selection via Imitation Learning. CoRR abs/2206.13414 (2022) - 2021
- [j1]Maria Guix, Rafael Mestre, Tania Patiño, Marco De Corato, Judith Fuentes, Giulia Zarpellon, Samuel Sánchez:
Biohybrid soft robots with self-stimulating skeletons. Sci. Robotics 6(53): 7577 (2021) - [c4]Giulia Zarpellon, Jason Jo, Andrea Lodi, Yoshua Bengio:
Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies. AAAI 2021: 3931-3939 - [c3]Maxime Gasse, Simon Bowly, Quentin Cappart, Jonas Charfreitag, Laurent Charlin, Didier Chételat, Antonia Chmiela, Justin Dumouchelle, Ambros M. Gleixner, Aleksandr M. Kazachkov, Elias B. Khalil, Pawel Lichocki, Andrea Lodi, Miles Lubin, Chris J. Maddison, Christopher Morris, Dimitri J. Papageorgiou, Augustin Parjadis, Sebastian Pokutta, Antoine Prouvost, Lara Scavuzzo, Giulia Zarpellon, Linxin Yang, Sha Lai, Akang Wang, Xiaodong Luo, Xiang Zhou, Haohan Huang, Sheng Cheng Shao, Yuanming Zhu, Dong Zhang, Tao Quan, Zixuan Cao, Yang Xu, Zhewei Huang, Shuchang Zhou, Binbin Chen, Minggui He, Hao Hao, Zhiyu Zhang, Zhiwu An, Kun Mao:
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. NeurIPS (Competition and Demos) 2021: 220-231 - 2020
- [i1]Giulia Zarpellon, Jason Jo, Andrea Lodi, Yoshua Bengio:
Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies. CoRR abs/2002.05120 (2020)
2010 – 2019
- 2019
- [c2]Martina Fischetti, Andrea Lodi, Giulia Zarpellon:
Learning MILP Resolution Outcomes Before Reaching Time-Limit. CPAIOR 2019: 275-291 - 2018
- [c1]Pierre Bonami, Andrea Lodi, Giulia Zarpellon:
Learning a Classification of Mixed-Integer Quadratic Programming Problems. CPAIOR 2018: 595-604
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-04-25 05:42 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:
