activity
20152018
collaborators

9 papers

math.CO2020

Binary scalar products

Andrey Kupavskii, Stefan Weltge

Let both span such that holds for all , . We show that $ |A| \cdot |B| \le (d+1) 2…

math.OC2020

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…

cs.DM2019

The stable set problem in graphs with bounded genus and bounded odd cycle packing number

Michele Conforti, Samuel Fiorin, Tony Huynh +2

Consider the family of graphs without node-disjoint odd cycles, where is a constant. Determining the complexity of the stable set problem for such graphs is a lon…

math.OC2018

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…

cs.DM2017

Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting

Alfonso Cevallos, Stefan Weltge, Rico Zenklusen

Mixed-integer mathematical programs are among the most commonly used models for a wide set of problems in Operations Research and related fields. However, there is still very littl…

math.OC2017

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…