default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Tramontani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2009
[b1]Andrea Tramontani:
Enhanced Mixed Integer Programming Techniques and Routing Problems. University of Bologna, Italy, 2009
Journal Articles
- 2023
- [j12]Claudio Contardo, Andrea Lodi
, Andrea Tramontani:
Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities. INFORMS J. Comput. 35(1): 2-4 (2023) - 2021
- [j11]Andrea Baggio, Margarida Carvalho, Andrea Lodi, Andrea Tramontani:
Multilevel Approaches for the Critical Node Problem. Oper. Res. 69(2): 486-508 (2021) - [j10]Karen I. Aardal, Andrea Lodi, Andrea Tramontani, Frederik von Heymann, Laurence A. Wolsey:
Lattice Reformulation Cuts. SIAM J. Optim. 31(4): 2539-2557 (2021) - 2020
- [j9]Ruobing Shen, Bo Tang, Andrea Lodi, Andrea Tramontani, Ismail Ben Ayed:
An ILP Model for Multi-Label MRFs With Connectivity Constraints. IEEE Trans. Image Process. 29: 6909-6917 (2020) - 2019
- [j8]Pierre Bonami, Andrea Lodi, Jonas Schweiger, Andrea Tramontani:
Solving Quadratic Programming by Cutting Planes. SIAM J. Optim. 29(2): 1076-1105 (2019) - 2016
- [j7]Matteo Fischetti, Andrea Lodi, Michele Monaci, Domenico Salvagnin, Andrea Tramontani:
Improving branch-and-cut performance by random sampling. Math. Program. Comput. 8(1): 113-132 (2016) - 2015
- [j6]Pierre Bonami, Andrea Lodi, Andrea Tramontani, Sven Wiese:
On mathematical programming with indicator constraints. Math. Program. 151(1): 191-223 (2015) - 2014
- [j5]Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey:
On the Practical Strength of Two-Row Tableau Cuts. INFORMS J. Comput. 26(2): 222-237 (2014) - 2012
- [j4]Sanjeeb Dash, Oktay Günlük, Andrea Lodi, Andrea Tramontani:
A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. INFORMS J. Comput. 24(1): 132-147 (2012) - 2011
- [j3]Andrea Tramontani:
Enhanced mixed integer programming techniques and routing problems. 4OR 9(3): 325-328 (2011) - [j2]Matteo Fischetti, Andrea Lodi, Andrea Tramontani:
On the separation of disjunctive cuts. Math. Program. 128(1-2): 205-230 (2011) - 2010
- [j1]Majid Salari, Paolo Toth, Andrea Tramontani:
An ILP improvement procedure for the Open Vehicle Routing Problem. Comput. Oper. Res. 37(12): 2106-2120 (2010)
Conference and Workshop Papers
- 2020
- [c3]Pierre Bonami, Domenico Salvagnin, Andrea Tramontani:
Implementing Automatic Benders Decomposition in a Modern MIP Solver. IPCO 2020: 78-90 - 2017
- [c2]Pierre Bonami, Andrea Lodi, Andrea Tramontani, Sven Wiese:
Cutting Planes from Wide Split Disjunctions. IPCO 2017: 99-110 - 2010
- [c1]Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey:
Experiments with Two Row Tableau Cuts. IPCO 2010: 424-437
Informal and Other Publications
- 2017
- [i1]Ruobing Shen, Eric Kendinibilir, Ismail Ben Ayed, Andrea Lodi, Andrea Tramontani, Gerhard Reinelt:
An ILP Solver for Multi-label MRFS with Connectivity Constraints. CoRR abs/1712.06020 (2017)
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-07-08 22:27 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:
