Timm Oertel

According to our database, Timm Oertel authored at least 17 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

New Bounds for the Integer Carathéodory Rank.

Iskander Aliev, Martin Henk, Mark Hogan, Stefan Kuhlmann, Timm Oertel

SIAM J. Optim., March, 2024

A colorful Steinitz Lemma with application to block-structured integer programs.

Timm Oertel, Joseph Paat, Robert Weismantel

Math. Program., March, 2024

Sparse Approximation in Lattices and Semigroups.

Stefan Kuhlmann, Timm Oertel, Robert Weismantel

CoRR, 2024

2022

Sparse representation of vectors in lattices and semigroups.

Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel

Math. Program., 2022

2020

The Distributions of Functions Related to Parametric Integer Optimization.

Timm Oertel, Joseph Paat, Robert Weismantel

SIAM J. Appl. Algebra Geom., 2020

Distances to lattice points in knapsack polyhedra.

Iskander Aliev, Martin Henk, Timm Oertel

Math. Program., 2020

Optimizing Sparsity over Lattices and Semigroups.

Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019

Sparsity of Integer Solutions in the Average Case.

Timm Oertel, Joseph Paat, Robert Weismantel

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018

The Support of Integer Optimal Solutions.

Iskander Aliev, Jesús A. De Loera, Friedrich Eisenbrand, Timm Oertel, Robert Weismantel

SIAM J. Optim., 2018

2017

Centerpoints: A Link between Optimization and Convex Geometry.

Amitabh Basu, Timm Oertel

SIAM J. Optim., 2017

Sparse Solutions of Linear Diophantine Equations.

Iskander Aliev, Jesús A. De Loera, Timm Oertel, Christopher O'Neill

SIAM J. Appl. Algebra Geom., 2017

Integrality Gaps of Integer Knapsack Problems.

Iskander Aliev, Martin Henk, Timm Oertel

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

A note on non-degenerate integer programs with small sub-determinants.

Stephan Artmann, Friedrich Eisenbrand, Christoph Glanzer, Timm Oertel, Santosh S. Vempala, Robert Weismantel

Oper. Res. Lett., 2016

Duality for mixed-integer convex minimization.

Michel Baes, Timm Oertel, Robert Weismantel

Math. Program., 2016

2015

A Polyhedral Frobenius Theorem with Applications to Integer Optimization.

David Adjiashvili, Timm Oertel, Robert Weismantel

SIAM J. Discret. Math., 2015

Note on the complexity of the mixed-integer hull of a polyhedron.

Robert Hildebrand, Timm Oertel, Robert Weismantel

Oper. Res. Lett., 2015

2014

Integer convex minimization by mixed integer linear optimization.

Timm Oertel, Christian Wagner, Robert Weismantel

Oper. Res. Lett., 2014