Heuristic decomposition and LP-based scheduling in make-and-pack production. - Philipp Baumann; Norbert Trautmann (IEEM, 2011)

Portfolio-optimization models for small investors. - Philipp Baumann; Norbert Trautmann (Math. Methods Oper. Res., 2013)

Efficient symmetry-breaking formulations for grouping customer orders in a printing shop. - Philipp Baumann; Norbert Trautmann (IEEM, 2014)

A hybrid method for large-scale short-term scheduling of make-and-pack production processes. - Philipp Baumann; Norbert Trautmann (Eur. J. Oper. Res., 2014)

Efficient deployment of mobile detectors for security applications. - Philipp Baumann; Reynold J. Cooper; Dorit S. Hochbaum; Nidhi Patel; Kunal Shalia (IEEM, 2015)

Improving fairness in staff assignment: An approach for lexicographic goal programming. - Tom Rihm; Philipp Baumann (IEEM, 2015)

Index tracking using data-mining techniques and mixed-binary linear programming. - Oliver Strub; Philipp Baumann (IEEM, 2015)

Sparse-Reduced Computation - Enabling Mining of Massively-large Data Sets. - Philipp Baumann; Dorit S. Hochbaum; Quico Spaen (ICPRAM, 2016)

High-Throughput Glomeruli Analysis of μ CT Kidney Images Using Tree Priors and Scalable Sparse Computation. - Carlos Correa Shokiche; Philipp Baumann; Ruslan Hlushchuk; Valentin Djonov; Mauricio Reyes 001 (MICCAI (2), 2016)

Sparse Computation for Large-Scale Data Mining. - Dorit S. Hochbaum; Philipp Baumann (IEEE Trans. Big Data, 2016)

High-performance geometric algorithms for sparse computation in big data analytics. - Philipp Baumann; Dorit S. Hochbaum; Quico Spaen (IEEE BigData, 2017)

A Matheuristic for a Real-world Variant of the Multiple Traveling Salesman Problem. - Philipp Baumann (IEEM, 2018)

Optimal construction and rebalancing of index-tracking portfolios. - Oliver Strub; Philipp Baumann (Eur. J. Oper. Res., 2018)

Staff assignment with lexicographically ordered acceptance levels. - Tom Rihm; Philipp Baumann (J. Sched., 2018)

A Binary Linear Programming-Based K-Means Approach for the Capacitated Centered Clustering Problem. - Philipp Baumann (IEEM, 2019)

Optimizing Customer Assignments to Direct Marketing Activities: A Binary Linear Programming Formulation. - Tamara Bigler; Philipp Baumann; Manuel Kammermann (IEEM, 2019)

A comparative study of the leading machine learning techniques and two new optimization algorithms. - Philipp Baumann; Dorit S. Hochbaum; Yan T. Yang (Eur. J. Oper. Res., 2019)

A Binary Linear Programming-Based K-Means Algorithm For Clustering with Must-Link and Cannot-Link Constraints. - Philipp Baumann (IEEM, 2020)

An Order-First Split-Second Approach to a Novel Variant of the Cardinality-Constrained Covering Traveling Salesperson Problem. - Chantal Schöni; Philipp Baumann; Norbert Trautmann (IEEM, 2020)

Minimizing Paper Waste and Setup Costs in Offset Printing. - Philipp Baumann; Manuel Kammermann; Silvan Elsaesser (IEEM, 2021)

A matheuristic for large-scale capacitated clustering. - Mario Gnägi; Philipp Baumann (Comput. Oper. Res., 2021)

A k-Means Algorithm for Clustering with Soft Must-link and Cannot-link Constraints. - Philipp Baumann; Dorit S. Hochbaum (ICPRAM, 2022)

FT-KMEANS: A Fast Algorithm For Fault-Tolerant Facility Location. - Philipp Baumann (IEEM, 2022)

PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm. - Philipp Baumann; Dorit S. Hochbaum (CoRR, 2022)

The MPFCC Algorithm: A Model-Based Approach for Fair-Capacitated Clustering. - Vanessa Tran; Manuel Kammermann; Philipp Baumann (IEEM, 2023)

A matheuristic for a customer assignment problem in direct marketing. - Tamara Bigler; Manuel Kammermann; Philipp Baumann (Eur. J. Oper. Res., 2023)

A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem. - Dorit S. Hochbaum; Philipp Baumann; Olivier Goldschmidt; Y. Zhang (Eur. J. Oper. Res., 2025)