Folgen
Steffen Borgwardt
Titel
Zitiert von
Zitiert von
Jahr
Discrete Wasserstein barycenters: Optimal transport for discrete data
E Anderes, S Borgwardt, J Miller
Mathematical Methods of Operations Research 84, 389-409, 2016
1172016
Geometric clustering for the consolidation of farmland and woodland
S Borgwardt, A Brieden, P Gritzmann
The Mathematical Intelligencer, 37-44, 2014
442014
An LP-based k-means algorithm for balancing weighted point sets
S Borgwardt, A Brieden, P Gritzmann
European Journal of Operational Research 263 (2), 349-355, 2017
362017
On the circuit diameter of dual transportation polyhedra
S Borgwardt, E Finhold, R Hemmecke
SIAM Journal on Discrete Mathematics 29 (1), 113-121, 2015
332015
Constrained Minimum-k-Star Clustering and its application to the consolidation of farmland
S Borgwardt, A Brieden, P Gritzmann
Operational Research 11, 1-17, 2011
272011
The diameters of network-flow polytopes satisfy the Hirsch conjecture
S Borgwardt, JA De Loera, E Finhold
Mathematical Programming 171, 283-309, 2018
262018
On the diameter of partition polytopes and vertex-disjoint cycle cover
S Borgwardt
Mathematical Programming 141 (1), 1-20, 2013
232013
On the computational complexity of finding a sparse Wasserstein barycenter
S Borgwardt, S Patterson
Journal of Combinatorial Optimization 41 (3), 736-761, 2021
222021
Edges versus circuits: a hierarchy of diameters in polyhedra
S Borgwardt, JA De Loera, E Finhold
Advances in Geometry 16 (4), 511-530, 2016
212016
An LP-based, strongly-polynomial 2-approximation algorithm for sparse Wasserstein barycenters
S Borgwardt
Operational Research 22 (2), 1511-1551, 2022
202022
Improved linear programs for discrete barycenters
S Borgwardt, S Patterson
Informs Journal on Optimization 2 (1), 14-33, 2020
182020
An implementation of steepest-descent augmentation for linear programs
S Borgwardt, C Viss
Operations Research Letters 48 (3), 323-328, 2020
162020
On the circuit diameter conjecture
S Borgwardt, T Stephen, T Yusun
Discrete & Computational Geometry 60, 558-587, 2018
152018
A combinatorial optimization approach to constrained clustering
SA Borgwardt
Technische Universität München, 2010
142010
A polyhedral model for enumeration and optimization over the set of circuits
S Borgwardt, C Viss
Discrete Applied Mathematics 308, 68-83, 2022
132022
The hierarchy of circuit diameters and transportation polytopes
S Borgwardt, JA De Loera, E Finhold, J Miller
Discrete Applied Mathematics 240, 8-24, 2018
122018
On soft power diagrams
S Borgwardt
Journal of Mathematical Modelling and Algorithms in Operations Research 14 …, 2015
122015
A balanced k-means algorithm for weighted point sets
S Borgwardt, A Brieden, P Gritzmann
arXiv preprint arXiv:1308.4004, 2013
112013
Circuit walks in integral polyhedra
S Borgwardt, C Viss
Discrete Optimization 44, 100566, 2022
92022
Good clusterings have large volume
S Borgwardt, F Happach
Operations Research 67 (1), 215-231, 2019
92019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20