Stefan Weltge

According to our database, Stefan Weltge authored at least 36 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A simple method for convex optimization in the oracle model.

Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge

Math. Program., July, 2024

Integer programs with nearly totally unimodular matrices: the cographic case.

Manuel Aprile, Samuel Fiorini, Gwenaël Joret, Stefan Kober, Michal T. Seweryn, Stefan Weltge, Yelena Yuditsky

CoRR, 2024

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack.

Jamico Schade, Makrand Sinha, Stefan Weltge

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023

Lifts for Voronoi Cells of Lattices.

Matthias Schymura, Ina Seidel, Stefan Weltge

Discret. Comput. Geom., October, 2023

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set.

Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge

CoRR, 2023

2022

Persistency of linear programming relaxations for the stable set problem.

Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter, Stefan Weltge

Math. Program., 2022

Extended formulations for stable set polytopes of graphs without two disjoint odd cycles.

Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge

Math. Program., 2022

Binary scalar products.

Andrey Kupavskii, Stefan Weltge

J. Comb. Theory B, 2022

Lattice-Free Simplices with Lattice Width 2d - o(d).

Lukas Mayrhofer, Jamico Schade, Stefan Weltge

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

The Pareto Cover Problem.

Bento Natura, Meike Neuwohner, Stefan Weltge

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Improved lower bound on the dimension of the EU council's voting rules.

Stefan Kober, Stefan Weltge

Optim. Lett., 2021

Strengthening convex relaxations of 0/1-sets using Boolean formulas.

Samuel Fiorini, Tony Huynh, Stefan Weltge

Math. Program., 2021

Minimum-cost integer circulations in given homology classes.

Sarah Morell, Ina Seidel, Stefan Weltge

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Integer programs with bounded subdeterminants and two nonzeros per row.

Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Distances between optimal solutions of mixed-integer programs.

Joseph Paat, Robert Weismantel, Stefan Weltge

Math. Program., 2020

Correction to: Extended Formulations for Independence Polytopes of Regular Matroids.

Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge

Graphs Comb., 2020

Simple Iterative Methods for Linear Optimization over Convex Sets.

Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge

CoRR, 2020

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

Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Extended formulations for radial cones.

Matthias Walter, Stefan Weltge

Oper. Res. Lett., 2019

Minimum-cost integer circulations in given homology classes.

Ina Seidel, Stefan Weltge

CoRR, 2019

Persistency of Linear Programming Formulations for the Stable Set Problem.

Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter, Stefan Weltge

CoRR, 2019

2018

Maximum semidefinite and linear extension complexity of families of polytopes.

Gennadiy Averkov, Volker Kaibel, Stefan Weltge

Math. Program., 2018

Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank.

Yohann Benchetrit, Samuel Fiorini, Tony Huynh, Stefan Weltge

Math. Oper. Res., 2018

Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting.

Alfonso Cevallos, Stefan Weltge, Rico Zenklusen

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Optimality certificates for convex minimization and Helly numbers.

Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Robert Weismantel, Stefan Weltge

Oper. Res. Lett., 2017

Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three.

Gennadiy Averkov, Jan Krümpelmann, Stefan Weltge

Math. Oper. Res., 2017

Three enhancements for optimization-based bound tightening.

Ambros M. Gleixner, Timo Berthold, Benjamin Müller, Stefan Weltge

J. Glob. Optim., 2017

Extension complexities of Cartesian products involving a pyramid.

Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen

Inf. Process. Lett., 2017

Tight bounds on discrete quantitative Helly numbers.

Gennadiy Averkov, Bernardo González Merino, Ingo Paschke, Matthias Schymura, Stefan Weltge

Adv. Appl. Math., 2017

2016

Extended Formulations for Independence Polytopes of Regular Matroids.

Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge

Graphs Comb., 2016

Characterizing Polytopes Contained in the $0/1$-Cube with Bounded Chvátal-Gomory Rank.

Yohann Benchetrit, Samuel Fiorini, Tony Huynh, Stefan Weltge

CoRR, 2016

2015

Hidden vertices in extensions of polytopes.

Kanstantsin Pashkovich, Stefan Weltge

Oper. Res. Lett., 2015

Subgraph polytopes and independence polytopes of count matroids.

Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge

Oper. Res. Lett., 2015

Lower bounds on the sizes of integer programs without additional variables.

Volker Kaibel, Stefan Weltge

Math. Program., 2015

A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially.

Volker Kaibel, Stefan Weltge

Discret. Comput. Geom., 2015

2013

Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming.

Ambros M. Gleixner, Stefan Weltge

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013