Philipp Baumann

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