
Integer programs with bounded subdeterminants and two nonzeros per row
We give a strongly polynomialtime algorithm for integer linear programs...
read it

Lifts for Voronoi cells of lattices
Many polytopes arising in polyhedral combinatorics are linear projection...
read it

Simple Iterative Methods for Linear Optimization over Convex Sets
We give simple iterative methods for computing approximately optimal pri...
read it

Binary scalar products
Let A,B ⊆ℝ^d both span ℝ^d such that ⟨ a, b ⟩∈{0,1} holds for all a ∈ A,...
read it

Improved lower bound on the dimension of the EU council's voting rules
Kurz and Napel (2015) proved that the voting system of the EU council (b...
read it

Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
Let G be an nnode graph without two disjoint odd cycles. The algorithm ...
read it

Minimumcost integer circulations in given homology classes
Let D be a directed graph cellularly embedded on a surface together with...
read it

Persistency of Linear Programming Formulations for the Stable Set Problem
The NemhauserTrotter theorem states that the standard linear programmin...
read it

The stable set problem in graphs with bounded genus and bounded odd cycle packing number
Consider the family of graphs without k nodedisjoint odd cycles, where ...
read it

Extended Formulations for Radial Cones
This paper studies extended formulations for radial cones at vertices of...
read it

Lifting Linear Extension Complexity Bounds to the MixedInteger Setting
Mixedinteger mathematical programs are among the most commonly used mod...
read it

Strengthening Convex Relaxations of 0/1Sets Using Boolean Formulas
In convex integer programming, various procedures have been developed to...
read it
Stefan Weltge
is this you? claim profile