default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Weltge
Person information
- affiliation: Technical University Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Daniel Dadush, Christopher Hojny
, Sophie Huiberts, Stefan Weltge:
A simple method for convex optimization in the oracle model. Math. Program. 206(1): 283-304 (2024)- [c12]Jamico Schade, Makrand Sinha, Stefan Weltge:
Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack. IPCO 2024: 379-392 - [i21]Manuel Aprile, Samuel Fiorini, Gwenaël Joret, Stefan Kober, Michal T. Seweryn, Stefan Weltge, Yelena Yuditsky:
Integer programs with nearly totally unimodular matrices: the cographic case. CoRR abs/2407.09477 (2024) - 2023
- [j21]Matthias Schymura, Ina Seidel, Stefan Weltge:
Lifts for Voronoi Cells of Lattices. Discret. Comput. Geom. 70(3): 845-865 (2023) - [i20]Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge:
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set. CoRR abs/2303.12850 (2023) - [i19]Jamico Schade, Makrand Sinha, Stefan Weltge:
Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack. CoRR abs/2308.16711 (2023) - 2022
- [j20]Andrey Kupavskii, Stefan Weltge:
Binary scalar products. J. Comb. Theory B 156: 18-30 (2022) - [j19]Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter, Stefan Weltge:
Persistency of linear programming relaxations for the stable set problem. Math. Program. 192(1): 387-407 (2022) - [j18]Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. Math. Program. 192(1): 547-566 (2022) - [c11]Bento Natura, Meike Neuwohner, Stefan Weltge:
The Pareto Cover Problem. ESA 2022: 80:1-80:12 - [c10]Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge:
A Simple Method for Convex Optimization in the Oracle Model. IPCO 2022: 154-167 - [c9]Lukas Mayrhofer, Jamico Schade, Stefan Weltge:
Lattice-Free Simplices with Lattice Width 2d - o(d). IPCO 2022: 375-386 - [i18]Bento Natura, Meike Neuwohner, Stefan Weltge:
The Pareto cover problem. CoRR abs/2202.08035 (2022) - 2021
- [j17]Samuel Fiorini, Tony Huynh, Stefan Weltge:
Strengthening convex relaxations of 0/1-sets using Boolean formulas. Math. Program. 190(1): 467-482 (2021) - [j16]Stefan Kober, Stefan Weltge:
Improved lower bound on the dimension of the EU council's voting rules. Optim. Lett. 15(4): 1293-1302 (2021) - [c8]Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky:
Integer programs with bounded subdeterminants and two nonzeros per row. FOCS 2021: 13-24 - [c7]Sarah Morell, Ina Seidel, Stefan Weltge:
Minimum-cost integer circulations in given homology classes. SODA 2021: 2725-2739 - [i17]Matthias Schymura, Ina Seidel, Stefan Weltge:
Lifts for Voronoi cells of lattices. CoRR abs/2106.04432 (2021) - [i16]Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky:
Integer programs with bounded subdeterminants and two nonzeros per row. CoRR abs/2106.05947 (2021) - 2020
- [j15]Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge:
Correction to: Extended Formulations for Independence Polytopes of Regular Matroids. Graphs Comb. 36(1): 177-179 (2020) - [j14]Joseph Paat, Robert Weismantel, Stefan Weltge:
Distances between optimal solutions of mixed-integer programs. Math. Program. 179(1): 455-468 (2020) - [c6]Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. IPCO 2020: 104-116 - [c5]Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter, Stefan Weltge:
Persistency of Linear Programming Relaxations for the Stable Set Problem. IPCO 2020: 351-363 - [c4]Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge:
The stable set problem in graphs with bounded genus and bounded odd cycle packing number. SODA 2020: 2896-2915 - [i15]Stefan Kober, Stefan Weltge:
Improved lower bound on the dimension of the EU council's voting rules. CoRR abs/2003.11366 (2020) - [i14]Andrey Kupavskii, Stefan Weltge:
Binary scalar products. CoRR abs/2008.07153 (2020) - [i13]Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge:
Simple Iterative Methods for Linear Optimization over Convex Sets. CoRR abs/2011.08557 (2020)
2010 – 2019
- 2019
- [j13]Matthias Walter, Stefan Weltge:
Extended formulations for radial cones. Oper. Res. Lett. 47(5): 458-463 (2019) - [i12]Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge:
The stable set problem in graphs with bounded genus and bounded odd cycle packing number. CoRR abs/1908.06300 (2019) - [i11]Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter, Stefan Weltge:
Persistency of Linear Programming Formulations for the Stable Set Problem. CoRR abs/1911.01478 (2019) - [i10]Ina Seidel, Stefan Weltge:
Minimum-cost integer circulations in given homology classes. CoRR abs/1911.10912 (2019) - [i9]Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. CoRR abs/1911.12179 (2019) - 2018
- [j12]Yohann Benchetrit, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank. Math. Oper. Res. 43(3): 718-725 (2018) - [j11]Gennadiy Averkov, Volker Kaibel, Stefan Weltge:
Maximum semidefinite and linear extension complexity of families of polytopes. Math. Program. 167(2): 381-394 (2018) - [c3]Alfonso Cevallos, Stefan Weltge, Rico Zenklusen:
Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting. SODA 2018: 788-807 - [i8]Matthias Walter, Stefan Weltge:
Extended Formulations for Radial Cones. CoRR abs/1805.10325 (2018) - 2017
- [j10]Gennadiy Averkov, Bernardo González Merino, Ingo Paschke, Matthias Schymura, Stefan Weltge:
Tight bounds on discrete quantitative Helly numbers. Adv. Appl. Math. 89: 76-101 (2017) - [j9]Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen:
Extension complexities of Cartesian products involving a pyramid. Inf. Process. Lett. 128: 11-13 (2017) - [j8]Ambros M. Gleixner, Timo Berthold, Benjamin Müller, Stefan Weltge:
Three enhancements for optimization-based bound tightening. J. Glob. Optim. 67(4): 731-757 (2017) - [j7]Gennadiy Averkov, Jan Krümpelmann, Stefan Weltge:
Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three. Math. Oper. Res. 42(4): 1035-1062 (2017) - [j6]Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Robert Weismantel, Stefan Weltge:
Optimality certificates for convex minimization and Helly numbers. Oper. Res. Lett. 45(6): 671-674 (2017) - [i7]Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen:
Extension complexities of Cartesian products involving a pyramid. CoRR abs/1702.01959 (2017) - [i6]Samuel Fiorini, Tony Huynh, Stefan Weltge:
Strengthening Convex Relaxations of 0/1-Sets Using Boolean Formulas. CoRR abs/1711.01358 (2017) - [i5]Alfonso Cevallos, Stefan Weltge, Rico Zenklusen:
Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting. CoRR abs/1712.02176 (2017) - 2016
- [j5]Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge:
Extended Formulations for Independence Polytopes of Regular Matroids. Graphs Comb. 32(5): 1931-1944 (2016) - [i4]Gennadiy Averkov, Volker Kaibel, Stefan Weltge:
Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes. CoRR abs/1605.08538 (2016) - [i3]Yohann Benchetrit, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Characterizing Polytopes Contained in the $0/1$-Cube with Bounded Chvátal-Gomory Rank. CoRR abs/1611.06593 (2016) - 2015
- [j4]Volker Kaibel, Stefan Weltge:
A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially. Discret. Comput. Geom. 53(2): 397-401 (2015) - [j3]Volker Kaibel, Stefan Weltge:
Lower bounds on the sizes of integer programs without additional variables. Math. Program. 154(1-2): 407-425 (2015) - [j2]Kanstantsin Pashkovich, Stefan Weltge:
Hidden vertices in extensions of polytopes. Oper. Res. Lett. 43(2): 161-164 (2015) - [j1]Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge:
Subgraph polytopes and independence polytopes of count matroids. Oper. Res. Lett. 43(5): 457-460 (2015) - [i2]Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge:
Subgraph Polytopes and Independence Polytopes of Count Matroids. CoRR abs/1502.02817 (2015) - [i1]Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge:
Extended Formulations for Independence Polytopes of Regular Matroids. CoRR abs/1504.03872 (2015) - 2014
- [c2]Volker Kaibel, Stefan Weltge:
Lower Bounds on the Sizes of Integer Programs without Additional Variables. IPCO 2014: 321-332 - 2013
- [c1]Ambros M. Gleixner, Stefan Weltge:
Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming. CPAIOR 2013: 355-361
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 20:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
