Stefan Weltge

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Integer programs with nearly totally unimodular matrices: the cographic case	2025	Manuel Aprile Samuel Fiorini Gwenaël Joret Stefan Kober Miehał T. Seweryn Stefan Weltge Yelena Yuditsky
+ PDF Chat	Integer programs with bounded subdeterminants and two nonzeros per row	2024	Samuel Fiorini Gwenaël Joret Stefan Weltge Yelena Yuditsky
+ PDF Chat	Integer programs with nearly totally unimodular matrices: the cographic case	2024	Manuel Aprile Samuel Fiorini Gwenaël Joret Stefan Kober Michał T. Seweryn Stefan Weltge Yelena Yuditsky
+ PDF Chat	A Branch-Price-Cut-And-Switch Approach for Optimizing Team Formation and Routing for Airport Baggage Handling Tasks with Stochastic Travel Times	2024	Andreas Hagn Rainer Kolisch Giacomo Dall’Olio Stefan Weltge
+ PDF Chat	Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack	2024	Jamico Schade Makrand Sinha Stefan Weltge
+ PDF Chat	A simple method for convex optimization in the oracle model	2023	Daniel Dadush Christopher Hojny Sophie Huiberts Stefan Weltge
+	Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set	2023	Karthekeyan Chandrasekaran Chandra Chekuri Samuel Fiorini Shubhang Kulkarni Stefan Weltge
+	Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack	2023	Jamico Schade Makrand Sinha Stefan Weltge
+	Binary scalar products	2022	Andrey Kupavskii Stefan Weltge
+ PDF Chat	Integer programs with bounded subdeterminants and two nonzeros per row	2022	Samuel Fiorini Gwenaël Joret Stefan Weltge Yelena Yuditsky
+ PDF Chat	A Simple Method for Convex Optimization in the Oracle Model	2022	Daniel Dadush Christopher Hojny Sophie Huiberts Stefan Weltge
+ PDF Chat	Lattice-Free Simplices with Lattice Width $$2d - o(d)$$	2022	Lukas Mayrhofer Jamico Schade Stefan Weltge
+	The Pareto cover problem	2022	Bento Natura Meike Neuwohner Stefan Weltge
+	Driver-aware charging infrastructure design	2022	Stefan Kober Maximilian Schiffer Stephan Sorgatz Stefan Weltge
+	Binary scalar products	2021	Andrey Kupavskii Stefan Weltge
+	Binary scalar products	2021	Andrey Kupavskii Stefan Weltge
+	Binary scalar products	2021	Andrey Kupavskii Stefan Weltge
+	Binary scalar products	2021	Andrey Kupavskii Stefan Weltge
+	Binary scalar products	2021	Andrey Kupavskii Stefan Weltge
+	Binary scalar products	2021	Andrey Kupavskii Stefan Weltge
+ PDF Chat	Extended formulations for stable set polytopes of graphs without two disjoint odd cycles	2021	Michele Conforti Samuel Fiorini Tony Huynh Stefan Weltge
+ PDF Chat	Persistency of linear programming relaxations for the stable set problem	2021	Elisabeth Rodríguez-Heck Karl Stickler Matthias Walter Stefan Weltge
+ PDF Chat	Minimum-cost integer circulations in given homology classes	2021	Sarah Morell Ina Seidel Stefan Weltge
+	Lattice-free simplices with lattice width $2d - o(d)$	2021	Lukas Mayrhofer Jamico Schade Stefan Weltge
+	Integer programs with bounded subdeterminants and two nonzeros per row	2021	Samuel Fiorini Gwenaël Joret Stefan Weltge Yelena Yuditsky
+	Lifts for Voronoi cells of lattices	2021	Matthias Schymura Ina Seidel Stefan Weltge
+	Simple Iterative Methods for Linear Optimization over Convex Sets.	2020	Daniel Dadush Christopher Hojny Sophie Huiberts Stefan Weltge
+	Binary scalar products.	2020	Andrey Kupavskii Stefan Weltge
+ PDF Chat	Strengthening convex relaxations of 0/1-sets using Boolean formulas	2020	Samuel Fiorini Tony Huynh Stefan Weltge
+	Improved lower bound on the dimension of the EU council's voting rules	2020	Stefan Kober Stefan Weltge
+ PDF Chat	Persistency of Linear Programming Relaxations for the Stable Set Problem	2020	Elisabeth Rodríguez-Heck Karl Stickler Matthias Walter Stefan Weltge
+ PDF Chat	Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles	2020	Michele Conforti Samuel Fiorini Tony Huynh Stefan Weltge
+	Improved lower bound on the dimension of the EU council's voting rules	2020	Stefan Kober Stefan Weltge
+	A Simple Method for Convex Optimization in the Oracle Model	2020	Daniel Dadush Christopher Hojny Sophie Huiberts Stefan Weltge
+	Binary scalar products	2020	Andrey Kupavskii Stefan Weltge
+ PDF Chat	The stable set problem in graphs with bounded genus and bounded odd cycle packing number	2019	Michele Conforti Samuel Fiorini Tony Huynh Gwenaël Joret Stefan Weltge
+	Minimum-cost integer circulations in given homology classes	2019	Sarah Morell Ina Seidel Stefan Weltge
+	Persistency of Linear Programming Relaxations for the Stable Set Problem	2019	Elisabeth Rodríguez-Heck Karl Stickler Matthias Walter Stefan Weltge
+	The stable set problem in graphs with bounded genus and bounded odd cycle packing number	2019	Michele Conforti Samuel Fiorin Tony Huynh Gwenaël Joret Stefan Weltge
+	Extended formulations for radial cones	2019	Matthias Walter Stefan Weltge
+	Minimum-cost integer circulations in given homology classes	2019	Sarah Morell Ina Seidel Stefan Weltge
+	Persistency of Linear Programming Relaxations for the Stable Set Problem	2019	Elisabeth Rodríguez-Heck Karl Stickler Matthias Walter Stefan Weltge
+	The stable set problem in graphs with bounded genus and bounded odd cycle packing number	2019	Michele Conforti Samuel Fiorin Tony Huynh Gwenaël Joret Stefan Weltge
+	Distances between optimal solutions of mixed-integer programs	2018	Joseph Paat Robert Weismantel Stefan Weltge
+	Extended Formulations for Radial Cones	2018	Matthias Walter Stefan Weltge
+	Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank	2018	Yohann Benchetrit Samuel Fiorini Tony Huynh Stefan Weltge
+	Distances of optimal solutions of mixed-integer programs	2018	Joseph Paat Robert Weismantel Stefan Weltge
+ PDF Chat	Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting	2018	Alfonso Cevallos Stefan Weltge Rico Zenklusen
+	Extended Formulations for Radial Cones	2018	Matthias Walter Stefan Weltge
+	Strengthening Convex Relaxations of 0/1-Sets Using Boolean Formulas	2017	Samuel Fiorini Tony Huynh Stefan Weltge
+ PDF Chat	Optimality certificates for convex minimization and Helly numbers	2017	Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge
+ PDF Chat	Extension complexities of Cartesian products involving a pyramid	2017	Hans Raj Tiwary Stefan Weltge Rico Zenklusen
+	Tight bounds on discrete quantitative Helly numbers	2017	Gennadiy Averkov Bernardo González Merino Ingo Paschke Matthias Schymura Stefan Weltge
+ PDF Chat	Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three	2017	Gennadiy Averkov Jan Krümpelmann Stefan Weltge
+ PDF Chat	Maximum semidefinite and linear extension complexity of families of polytopes	2017	Gennadiy Averkov Volker Kaibel Stefan Weltge
+	Extension complexities of Cartesian products involving a pyramid	2017	Hans Raj Tiwary Stefan Weltge Rico Zenklusen
+	Strengthening Convex Relaxations of 0/1-Sets Using Boolean Formulas	2017	Samuel Fiorini Tony Huynh Stefan Weltge
+	Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting	2017	Alfonso Cevallos Stefan Weltge Rico Zenklusen
+	Extension complexities of Cartesian products involving a pyramid	2017	Hans Raj Tiwary Stefan Weltge Rico Zenklusen
+	Characterizing Polytopes Contained in the $0/1$-Cube with Bounded Chv\'atal-Gomory Rank	2016	Yohann Benchetrit Samuel Fiorini Tony Huynh Stefan Weltge
+	Optimality certificates for convex minimization and Helly numbers	2016	Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge
+	Three enhancements for optimization-based bound tightening	2016	Ambros Gleixner Timo Berthold Benjamin Müller Stefan Weltge
+ PDF Chat	Extended Formulations for Independence Polytopes of Regular Matroids	2016	Volker Kaibel Jon Lee Matthias Walter Stefan Weltge
+	Tight bounds on discrete quantitative Helly numbers	2016	Gennadiy Averkov Bernardo González Merino Matthias Henze Ingo Paschke Stefan Weltge
+	Characterizing Polytopes Contained in the $0/1$-Cube with Bounded Chvátal-Gomory Rank	2016	Yohann Benchetrit Samuel Fiorini Tony Huynh Stefan Weltge
+	Optimality certificates for convex minimization and Helly numbers	2016	Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge
+	Tight bounds on discrete quantitative Helly numbers	2016	Gennadiy Averkov Bernardo González Merino Matthias Henze Ingo Paschke Stefan Weltge
+	Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes	2016	Gennadiy Averkov Volker Kaibel Stefan Weltge
+	Notions of maximality for integral lattice-free polyhedra: the case of dimension three	2015	Gennadiy Averkov Jan Krümpelmann Stefan Weltge
+ PDF Chat	Subgraph polytopes and independence polytopes of count matroids	2015	Michele Conforti Volker Kaibel Matthias Walter Stefan Weltge
+	Subgraph Polytopes and Independence Polytopes of Count Matroids	2015	Michele Conforti Volker Kaibel Matthias Walter Stefan Weltge
+ PDF Chat	Hidden vertices in extensions of polytopes	2015	Kanstantsin Pashkovich Stefan Weltge
+	Subgraph Polytopes and Independence Polytopes of Count Matroids	2015	Michele Conforti Volker Kaibel Matthias Walter Stefan Weltge
+	Notions of maximality for integral lattice-free polyhedra: the case of dimension three	2015	Gennadiy Averkov Jan Krümpelmann Stefan Weltge
+ PDF Chat	A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially	2014	Volker Kaibel Stefan Weltge
+ PDF Chat	Lower bounds on the sizes of integer programs without additional variables	2014	Volker Kaibel Stefan Weltge
+	Hidden Vertices in Extensions of Polytopes	2014	Kanstantsin Pashkovich Stefan Weltge
+ PDF Chat	Lower Bounds on the Sizes of Integer Programs without Additional Variables	2014	Volker Kaibel Stefan Weltge
+	Computing The Extension Complexities of All 4-Dimensional 0/1-Polytopes	2014	Michael L. Oelze Arnaud Vandaele Stefan Weltge
+	Hidden Vertices in Extensions of Polytopes	2014	Kanstantsin Pashkovich Stefan Weltge
+	Lower Bounds on the Sizes of Integer Programs Without Additional Variables	2013	Volker Kaibel Stefan Weltge
+	Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming	2013	Ambros Gleixner Stefan Weltge
+	Lower Bounds on the Sizes of Integer Programs Without Additional Variables	2013	Volker Kaibel Stefan Weltge

Common Coauthors

Coauthor	Papers Together
Samuel Fiorini	15
Michele Conforti	11
Tony Huynh	11
Volker Kaibel	11
Andrey Kupavskii	9
Gennadiy Averkov	8
Gwenaël Joret	8
Matthias Walter	8
Rico Zenklusen	5
Stefan Kober	5
Robert Weismantel	5
Yelena Yuditsky	5
Jamico Schade	4
Elisabeth Rodríguez-Heck	4
Sophie Huiberts	4
Christopher Hojny	4
Daniel Dadush	4
Bernardo González Merino	3
Jan Krümpelmann	3
Gérard Cornuéjols	3
Ingo Paschke	3
Karl Stickler	3
Amitabh Basu	3
Matthias Walter	3
Hans Raj Tiwary	3
Yohann Benchetrit	3
Kanstantsin Pashkovich	3
Ina Seidel	3
Sarah Morell	3
Lukas Mayrhofer	2
Ambros Gleixner	2
Makrand Sinha	2
Joseph Paat	2
Matthias Schymura	2
Samuel Fiorin	2
Alfonso Cevallos	2
Manuel Aprile	2
Matthias Henze	2
Meike Neuwohner	1
Maximilian Schiffer	1
Michał T. Seweryn	1
Jon Lee	1
Stephan Sorgatz	1
Giacomo Dall’Olio	1
Ina Seidel	1
Miehał T. Seweryn	1
Arnaud Vandaele	1
Benjamin Müller	1
Bento Natura	1
Shubhang Kulkarni	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Linear vs. semidefinite extended formulations	2012	Samuel Fiorini Serge Massar Sebastian Pokutta Hans Raj Tiwary Ronald de Wolf	8
+ PDF Chat	Some 0/1 polytopes need exponential size extended formulations	2012	Thomas Rothvoß	6
+ PDF Chat	Theory of Linear and Integer Programming.	1987	David K. Smith Alexander Schrijver	6
+ PDF Chat	The matching polytope has exponential extension complexity	2014	Thomas Rothvoß	6
+	Integer program with bimodular matrix	2009	С. И. Веселов A. Ju. Chirkov	6
+	Integer Programming	2014	Michele Conforti Gérard Cornuéjols Giacomo Zambelli	5
+	Blowing up convex sets in the plane	1990	C.A.J. Hurkens	5
+ PDF Chat	Extended formulations in combinatorial optimization	2013	Michele Conforti Gérard Cornuéjols Giacomo Zambelli	5
+	A note on the extension complexity of the knapsack polytope	2013	Sebastian Pokutta Mathieu Van Vyve	5
+	On certain polytopes associated with graphs	1975	Vašek Chvátal	5
+	A strongly polynomial algorithm for bimodular integer linear programming	2017	Stephan Artmann Robert Weismantel Rico Zenklusen	4
+	On the minors of an incidence matrix and its Smith normal form	1995	Jerrold W. Grossman Amey Kulkarni Irwin E. Schochetman	4
+ PDF Chat	The stable set problem in graphs with bounded genus and bounded odd cycle packing number	2019	Michele Conforti Samuel Fiorini Tony Huynh Gwenaël Joret Stefan Weltge	4
+ PDF Chat	On Sub-determinants and the Diameter of Polyhedra	2014	Nicolas Bonifas Marco Di Summa Friedrich Eisenbrand Nicolai Hähnle Martin Niemeier	4
+ PDF Chat	Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting	2018	Alfonso Cevallos Stefan Weltge Rico Zenklusen	4
+ PDF Chat	Two row mixed-integer cuts via lifting	2010	Santanu S. Dey Laurence A. Wolsey	4
+	Sensitivity theorems in integer linear programming	1986	William J. Cook A.M.H. Gerards Alexander Schrijver Éva Tardos	4
+ PDF Chat	On Maximal $S$-Free Sets and the Helly Number for the Family of $S$-Convex Sets	2013	Gennadiy Averkov	4
+	Geometric random edge	2016	Friedrich Eisenbrand Santosh Vempala	4
+	Random walks, totally unimodular matrices, and a randomised dual simplex algorithm	1994	Martin Dyer Alan Frieze	4
+	First-Order Methods in Optimization	2017	Amir Beck	3
+ PDF Chat	Rescaling Algorithms for Linear Conic Feasibility	2020	Daniel Dadush László A. Végh Giacomo Zambelli	3
+ PDF Chat	Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem	2004	U. Betke	3
+ PDF Chat	Disjunctive Programming	1979	Egon Balas	3
+	The b-hull of an integer program	1981	Laurence A. Wolsey	3
+ PDF Chat	A geometric approach to cut-generating functions	2015	Amitabh Basu Michele Conforti Marco Di Summa	3
+	A strongly polynomial algorithm for linear systems having a binary solution	2011	Sergei Chubanov	3
+ PDF Chat	Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles	2020	Michele Conforti Samuel Fiorini Tony Huynh Stefan Weltge	3
+ PDF Chat	A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization	2015	Yin Tat Lee Aaron Sidford Sam Chiu-wai Wong	3
+	Geometrie der Zahlen	1896	H. Minkowski	3
+ PDF Chat	Outline of an algorithm for integer solutions to linear programs	1958	Ralph E. Gomory	3
+ PDF Chat	A proof of Lovász’s theorem on maximal lattice-free sets	2012	Gennadiy Averkov	3
+ PDF Chat	Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma	2018	Friedrich Eisenbrand Robert Weismantel	3
+	Projective-planar signed graphs and tangled signed graphs	2007	Daniel Slilaty	3
+	Integer programming duality: Price functions and sensitivity analysis	1981	Laurence A. Wolsey	3
+ PDF Chat	Duality for mixed-integer convex minimization	2015	Michel Baes Timm Oertel Robert Weismantel	3
+	A simple polynomial-time rescaling algorithm for solving linear programs	2007	John Dunagan Santosh Vempala	3
+	A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)	2007	Endre Boros Peter L. Hammer Richard Sun Gabriel Tavares	3
+	Edmonds polytopes and a hierarchy of combinatorial problems	1973	Vašek Chvátal	3
+	A Strong Dual for Conic Mixed-Integer Programs	2012	Diego A. Morán R. Santanu S. Dey Juan Pablo Vielma	3
+	A new algorithm for minimizing convex functions over convex sets	1996	Pravin M. Vaidya	3
+ PDF Chat	Smallest compact formulation for the permutahedron	2014	Michel X. Goemans	3
+ PDF Chat	Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma	2019	Friedrich Eisenbrand Robert Weismantel	3
+	A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs	1999	Edward M. Smith Constantinos C. Pantelides	2
+ PDF Chat	Projecting Lattice Polytopes Without Interior Lattice Points	2011	Benjamin Nill Günter M. Ziegler	2
+	Lectures on Modern Convex Optimization	2001	Aharon Ben‐Tal Arkadi Nemirovski	2
+ PDF Chat	Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols	2012	Yuri Faenza Samuel Fiorini Roland Grappe Hans Raj Tiwary	2
+ PDF Chat	The dimension of intersections of convex sets	1962	Branko Grünbaum	2
+	None	1999	Juan M. Zamora Ignacio E. Grossmann	2
+ PDF Chat	n-Fold integer programming in cubic time	2011	Raymond Hemmecke Shmuel Onn Lyubov Romanchuk	2