68 citations · 142 across the 43 of their papers we have counts for
5 papers · 1 filter
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…
Submodular Maximization through the Lens of Linear Programming
Simon Bruggmann, Rico Zenklusen
The simplex algorithm for linear programming is based on the fact that any local optimum with respect to the polyhedral neighborhood is also a global optimum. We show that a simila…
Submodular Minimization Under Congruency Constraints
Martin Nägele, Benny Sudakov, Rico Zenklusen
Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Sur…
A Framework for the Secretary Problem on the Intersection of Matroids
Moran Feldman, Ola Svensson, Rico Zenklusen
The secretary problem became one of the most prominent online selection problems due to its numerous applications in online mechanism design. The task is to select a maximum weight…
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…