Timm Oertel

Orcid: 0000-0001-5720-8978

Affiliations:
  • University of Erlangen-Nurember, Germany


According to our database1, Timm Oertel authored at least 16 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
New Bounds for the Integer Carathéodory Rank.
SIAM J. Optim., March, 2024

A colorful Steinitz Lemma with application to block-structured integer programs.
Math. Program., March, 2024

2022
Sparse representation of vectors in lattices and semigroups.
Math. Program., 2022

2020
The Distributions of Functions Related to Parametric Integer Optimization.
SIAM J. Appl. Algebra Geom., 2020

Distances to lattice points in knapsack polyhedra.
Math. Program., 2020

Optimizing Sparsity over Lattices and Semigroups.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019
Sparsity of Integer Solutions in the Average Case.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018
The Support of Integer Optimal Solutions.
SIAM J. Optim., 2018

2017
Centerpoints: A Link between Optimization and Convex Geometry.
SIAM J. Optim., 2017

Sparse Solutions of Linear Diophantine Equations.
SIAM J. Appl. Algebra Geom., 2017

Integrality Gaps of Integer Knapsack Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
A note on non-degenerate integer programs with small sub-determinants.
Oper. Res. Lett., 2016

Duality for mixed-integer convex minimization.
Math. Program., 2016

2015
A Polyhedral Frobenius Theorem with Applications to Integer Optimization.
SIAM J. Discret. Math., 2015

Note on the complexity of the mixed-integer hull of a polyhedron.
Oper. Res. Lett., 2015

2014
Integer convex minimization by mixed integer linear optimization.
Oper. Res. Lett., 2014


  Loading...