default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimm Oertel
Person information
- affiliation: University of Erlangen-Nurember, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Timm Oertel, Joseph Paat
, Robert Weismantel:
A colorful Steinitz Lemma with application to block-structured integer programs. Math. Program. 204(1): 677-702 (2024)- [j12]Iskander Aliev, Martin Henk, Mark Hogan, Stefan Kuhlmann, Timm Oertel:
New Bounds for the Integer Carathéodory Rank. SIAM J. Optim. 34(1): 190-200 (2024) - 2022
- [j11]Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel:
Sparse representation of vectors in lattices and semigroups. Math. Program. 192(1): 519-546 (2022) - 2020
- [j10]Iskander Aliev, Martin Henk, Timm Oertel:
Distances to lattice points in knapsack polyhedra. Math. Program. 182(1): 175-198 (2020) - [j9]Timm Oertel, Joseph Paat, Robert Weismantel:
The Distributions of Functions Related to Parametric Integer Optimization. SIAM J. Appl. Algebra Geom. 4(3): 422-440 (2020) - [c4]Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel:
Optimizing Sparsity over Lattices and Semigroups. IPCO 2020: 40-51
2010 – 2019
- 2019
- [c3]Timm Oertel, Joseph Paat, Robert Weismantel:
Sparsity of Integer Solutions in the Average Case. IPCO 2019: 341-353 - 2018
- [j8]Iskander Aliev, Jesús A. De Loera, Friedrich Eisenbrand, Timm Oertel, Robert Weismantel:
The Support of Integer Optimal Solutions. SIAM J. Optim. 28(3): 2152-2157 (2018) - 2017
- [j7]Iskander Aliev, Jesús A. De Loera, Timm Oertel, Christopher O'Neill:
Sparse Solutions of Linear Diophantine Equations. SIAM J. Appl. Algebra Geom. 1(1): 239-253 (2017) - [j6]Amitabh Basu, Timm Oertel:
Centerpoints: A Link between Optimization and Convex Geometry. SIAM J. Optim. 27(2): 866-889 (2017) - [c2]Iskander Aliev, Martin Henk, Timm Oertel:
Integrality Gaps of Integer Knapsack Problems. IPCO 2017: 25-38 - 2016
- [j5]Michel Baes, Timm Oertel, Robert Weismantel:
Duality for mixed-integer convex minimization. Math. Program. 158(1-2): 547-564 (2016) - [j4]Stephan Artmann, Friedrich Eisenbrand, Christoph Glanzer, Timm Oertel, Santosh S. Vempala, Robert Weismantel:
A note on non-degenerate integer programs with small sub-determinants. Oper. Res. Lett. 44(5): 635-639 (2016) - [c1]Amitabh Basu, Timm Oertel:
Centerpoints: A Link Between Optimization and Convex Geometry. IPCO 2016: 14-25 - 2015
- [j3]Robert Hildebrand, Timm Oertel, Robert Weismantel:
Note on the complexity of the mixed-integer hull of a polyhedron. Oper. Res. Lett. 43(3): 279-282 (2015) - [j2]David Adjiashvili, Timm Oertel, Robert Weismantel:
A Polyhedral Frobenius Theorem with Applications to Integer Optimization. SIAM J. Discret. Math. 29(3): 1287-1302 (2015) - 2014
- [j1]Timm Oertel, Christian Wagner, Robert Weismantel:
Integer convex minimization by mixed integer linear optimization. Oper. Res. Lett. 42(6-7): 424-428 (2014)
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-06-04 20:39 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:
