5 papers · 1 filter
The Pareto cover problem
Bento Natura, Meike Neuwohner, Stefan Weltge
We introduce the problem of finding a set of points in such that the expected cost of the cheapest point in that dominates a random point from is mi…
Improved lower bound on the dimension of the EU council's voting rules
Stefan Kober, Stefan Weltge
Kurz and Napel (2015) proved that the voting system of the EU council (based on the 2014 population data) cannot be represented as the intersection of six weighted games, i.e., its…
Distances of optimal solutions of mixed-integer programs
Joseph Paat, Robert Weismantel, Stefan Weltge
A classic result of Cook et al. (1986) bounds the distances between optimal solutions of mixed-integer linear programs and optimal solutions of the corresponding linear relaxations…
Extension complexities of Cartesian products involving a pyramid
Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen
It is an open question whether the linear extension complexity of the Cartesian product of two polytopes P, Q is the sum of the extension complexities of P and Q. We give an affirm…
Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes
Gennadiy Averkov, Volker Kaibel, Stefan Weltge
We relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its mem…