Urmăriți
Stefan Weltge
Stefan Weltge
Assistant Professor at Technical University of Munich
Adresă de e-mail confirmată pe tum.de - Pagina de pornire
Titlu
Citat de
Citat de
Anul
Three enhancements for optimization-based bound tightening
AM Gleixner, T Berthold, B Müller, S Weltge
Journal of Global Optimization 67, 731-757, 2017
892017
A short proof that the extension complexity of the correlation polytope grows exponentially
V Kaibel, S Weltge
Discrete & Computational Geometry 53, 397-401, 2015
692015
Lower bounds on the sizes of integer programs without additional variables
V Kaibel, S Weltge
Mathematical Programming 154 (1-2), 407-425, 2015
362015
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
322017
Distances between optimal solutions of mixed-integer programs
J Paat, R Weismantel, S Weltge
Mathematical Programming 179 (1-2), 455-468, 2020
242020
Sizes of linear descriptions in combinatorial optimization
S Weltge
Magdeburg, Universität, Diss., 2015
242015
Subgraph polytopes and independence polytopes of count matroids
M Conforti, V Kaibel, M Walter, S Weltge
Operations research letters 43 (5), 457-460, 2015
222015
Strengthening convex relaxations of 0/1-sets using Boolean formulas
S Fiorini, T Huynh, S Weltge
Mathematical programming 190, 467-482, 2021
162021
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
162020
Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
AM Gleixner, S Weltge
Integration of AI and OR Techniques in Constraint Programming for …, 2013
162013
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
M Conforti, S Fiorini, T Huynh, S Weltge
Mathematical Programming 192 (1), 547-566, 2022
142022
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
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
122018
Hidden vertices in extensions of polytopes
K Pashkovich, S Weltge
Operations Research Letters 43 (2), 161-164, 2015
122015
Integer programs with bounded subdeterminants and two nonzeros per row
S Fiorini, G Joret, S Weltge, Y Yuditsky
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 13-24, 2022
92022
Maximum semidefinite and linear extension complexity of families of polytopes
G Averkov, V Kaibel, S Weltge
Mathematical Programming 167, 381-394, 2018
92018
Extended formulations for independence polytopes of regular matroids
V Kaibel, J Lee, M Walter, S Weltge
Graphs and combinatorics 32, 1931-1944, 2016
92016
Computing the extension complexities of all 4-dimensional 0/1-polytopes
M Oelze, A Vandaele, S Weltge
arXiv preprint arXiv:1406.4895, 2014
92014
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
82017
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
52018
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20