Stefan Weltge
Title
Cited by
Cited by
Year
A short proof that the extension complexity of the correlation polytope grows exponentially
V Kaibel, S Weltge
Discrete & Computational Geometry 53 (2), 397-401, 2015
622015
Three enhancements for optimization-based bound tightening
AM Gleixner, T Berthold, B Müller, S Weltge
Journal of Global Optimization 67 (4), 731-757, 2017
572017
Notions of maximality for integral lattice-free polyhedra: the case of dimension three
G Averkov, J Krümpelmann, S Weltge
Mathematics of Operations Research 42 (4), 1035-1062, 2017
292017
Lower bounds on the sizes of integer programs without additional variables
V Kaibel, S Weltge
Mathematical Programming 154 (1), 407-425, 2015
282015
Sizes of linear descriptions in combinatorial optimization
S Weltge
Universitätsbibliothek, 2015
182015
Subgraph polytopes and independence polytopes of count matroids
M Conforti, V Kaibel, M Walter, S Weltge
Operations research letters 43 (5), 457-460, 2015
152015
Distances between optimal solutions of mixed-integer programs
J Paat, R Weismantel, S Weltge
Mathematical Programming 179 (1), 455-468, 2020
132020
Tight bounds on discrete quantitative Helly numbers
G Averkov, BG Merino, I Paschke, M Schymura, S Weltge
Advances in Applied Mathematics 89, 76-101, 2017
132017
Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
AM Gleixner, S Weltge
International Conference on AI and OR Techniques in Constriant Programming …, 2013
132013
Strengthening convex relaxations of 0/1-sets using Boolean formulas
S Fiorini, T Huynh, S Weltge
Mathematical Programming, 1-16, 2020
122020
Hidden vertices in extensions of polytopes
K Pashkovich, S Weltge
Operations Research Letters 43 (2), 161-164, 2015
112015
Extended formulations for independence polytopes of regular matroids
V Kaibel, J Lee, M Walter, S Weltge
Graphs and combinatorics 32 (5), 1931-1944, 2016
82016
Maximum semidefinite and linear extension complexity of families of polytopes
G Averkov, V Kaibel, S Weltge
Mathematical Programming 167 (2), 381-394, 2018
72018
Computing the extension complexities of all 4-dimensional 0/1-polytopes
M Oelze, A Vandaele, S Weltge
arXiv preprint arXiv:1406.4895, 2014
62014
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
M Conforti, S Fiorini, T Huynh, G Joret, S Weltge
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
42020
Characterizing polytopes in the 0/1-cube with bounded chvátal-gomory rank
Y Benchetrit, S Fiorini, T Huynh, S Weltge
Mathematics of Operations Research 43 (3), 718-725, 2018
42018
Lifting linear extension complexity bounds to the mixed-integer setting
A Cevallos, S Weltge, R Zenklusen
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
42018
Optimality certificates for convex minimization and Helly numbers
A Basu, M Conforti, G Cornuéjols, R Weismantel, S Weltge
Operations Research Letters 45 (6), 671-674, 2017
32017
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
M Conforti, S Fiorini, T Huynh, S Weltge
Mathematical Programming, 1-20, 2021
22021
Improved lower bound on the dimension of the EU council’s voting rules
S Kober, S Weltge
Optimization Letters, 1-10, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20