Philipp Baumann

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 22

Top Topics

Linear Programming

Production Processes

Clustering Algorithm

Top Venues

Eur. J. Oper. Res.

Publications

Tamara Bigler, Manuel Kammermann, Philipp Baumann
A matheuristic for a customer assignment problem in direct marketing. Eur. J. Oper. Res. 304 (2) (2023)
Vanessa Tran, Manuel Kammermann, Philipp Baumann
The MPFCC Algorithm: A Model-Based Approach for Fair-Capacitated Clustering. IEEM (2023)
Philipp Baumann, Dorit S. Hochbaum
A k-Means Algorithm for Clustering with Soft Must-link and Cannot-link Constraints. ICPRAM (2022)
Philipp Baumann, Dorit S. Hochbaum
PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm. CoRR (2022)
Philipp Baumann
FT-KMEANS: A Fast Algorithm For Fault-Tolerant Facility Location. IEEM (2022)
Mario Gnägi, Philipp Baumann
A matheuristic for large-scale capacitated clustering. Comput. Oper. Res. 132 (2021)
Philipp Baumann, Manuel Kammermann, Silvan Elsaesser
Minimizing Paper Waste and Setup Costs in Offset Printing. IEEM (2021)
Philipp Baumann
A Binary Linear Programming-Based K-Means Algorithm For Clustering with Must-Link and Cannot-Link Constraints. IEEM (2020)
Chantal Schöni, Philipp Baumann, Norbert Trautmann
An Order-First Split-Second Approach to a Novel Variant of the Cardinality-Constrained Covering Traveling Salesperson Problem. IEEM (2020)
Philipp Baumann
A Binary Linear Programming-Based K-Means Approach for the Capacitated Centered Clustering Problem. IEEM (2019)
Tamara Bigler, Philipp Baumann, Manuel Kammermann
Optimizing Customer Assignments to Direct Marketing Activities: A Binary Linear Programming Formulation. IEEM (2019)
Philipp Baumann, Dorit S. Hochbaum, Yan T. Yang
A comparative study of the leading machine learning techniques and two new optimization algorithms. Eur. J. Oper. Res. 272 (3) (2019)
Tom Rihm, Philipp Baumann
Staff assignment with lexicographically ordered acceptance levels. J. Sched. 21 (2) (2018)
Philipp Baumann
A Matheuristic for a Real-world Variant of the Multiple Traveling Salesman Problem. IEEM (2018)
Oliver Strub, Philipp Baumann
Optimal construction and rebalancing of index-tracking portfolios. Eur. J. Oper. Res. 264 (1) (2018)
Philipp Baumann, Dorit S. Hochbaum, Quico Spaen
High-performance geometric algorithms for sparse computation in big data analytics. IEEE BigData (2017)
Dorit S. Hochbaum, Philipp Baumann
Sparse Computation for Large-Scale Data Mining. IEEE Trans. Big Data 2 (2) (2016)
Philipp Baumann, Dorit S. Hochbaum, Quico Spaen
Sparse-Reduced Computation - Enabling Mining of Massively-large Data Sets. ICPRAM (2016)
Carlos Correa Shokiche, Philipp Baumann, Ruslan Hlushchuk, Valentin Djonov, Mauricio Reyes
High-Throughput Glomeruli Analysis of μ CT Kidney Images Using Tree Priors and Scalable Sparse Computation. MICCAI (2) (2016)
Oliver Strub, Philipp Baumann
Index tracking using data-mining techniques and mixed-binary linear programming. IEEM (2015)
Philipp Baumann, Reynold J. Cooper, Dorit S. Hochbaum, Nidhi Patel, Kunal Shalia
Efficient deployment of mobile detectors for security applications. IEEM (2015)
Tom Rihm, Philipp Baumann
Improving fairness in staff assignment: An approach for lexicographic goal programming. IEEM (2015)
Philipp Baumann, Norbert Trautmann
A hybrid method for large-scale short-term scheduling of make-and-pack production processes. Eur. J. Oper. Res. 236 (2) (2014)
Philipp Baumann, Norbert Trautmann
Efficient symmetry-breaking formulations for grouping customer orders in a printing shop. IEEM (2014)
Dorit S. Hochbaum, Philipp Baumann
Sparse computation for large-scale data mining. IEEE BigData (2014)
Philipp Baumann, Norbert Trautmann
Portfolio-optimization models for small investors. Math. Methods Oper. Res. 77 (3) (2013)
Philipp Baumann, Norbert Trautmann
Heuristic decomposition and LP-based scheduling in make-and-pack production. IEEM (2011)