The following pages link to Timm Oertel (Q304262):
Displaying 19 items.
- Duality for mixed-integer convex minimization (Q304264) (← links)
- (Q1755834) (redirect page) (← links)
- A note on non-degenerate integer programs with small sub-determinants (Q1755835) (← links)
- Integer convex minimization by mixed integer linear optimization (Q1785273) (← links)
- Note on the complexity of the mixed-integer hull of a polyhedron (Q1785359) (← links)
- Sparse representation of vectors in lattices and semigroups (Q2118144) (← links)
- Distances to lattice points in knapsack polyhedra (Q2191767) (← links)
- Sparsity of integer solutions in the average case (Q2293093) (← links)
- Integrality gaps of integer knapsack problems (Q2401142) (← links)
- Centerpoints: A Link Between Optimization and Convex Geometry (Q3186488) (← links)
- The Support of Integer Optimal Solutions (Q4577743) (← links)
- Optimizing Sparsity over Lattices and Semigroups (Q5041733) (← links)
- The Distributions of Functions Related to Parametric Integer Optimization (Q5125408) (← links)
- Mirror-Descent Methods in Mixed-Integer Convex Optimization (Q5265166) (← links)
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization (Q5499737) (← links)
- Centerpoints: A Link between Optimization and Convex Geometry (Q5737732) (← links)
- Sparse Solutions of Linear Diophantine Equations (Q5737776) (← links)
- A colorful Steinitz lemma with application to block-structured integer programs (Q6120853) (← links)
- New Bounds for the Integer Carathéodory Rank (Q6136661) (← links)
