A Fast Algorithm for Euclidean Maximum Weight Non-Bipartite Matching.

Philipp Baumann Philipp Baumann Olivier Goldschmidt Dorit S. Hochbaum A Fast Algorithm for Euclidean Maximum Weight Non-Bipartite Matching. 411-418 2026 ICPRAM https://doi.org/10.5220/0014406600004067 conf/icpram/2026 db/conf/icpram/icpram2026.html#BaumannGH26

Philipp Baumann Olivier Goldschmidt Dorit S. Hochbaum Jason Yang A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm. 2026 January abs/2601.06351 CoRR https://doi.org/10.48550/arXiv.2601.06351 db/journals/corr/corr2601.html#abs-2601-06351 streams/journals/corr

Dorit S. Hochbaum Philipp Baumann Olivier Goldschmidt Y. Zhang A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem. 425-440 2025 323 Eur. J. Oper. Res. 2 https://doi.org/10.1016/j.ejor.2024.12.019 db/journals/eor/eor323.html#HochbaumBGZ25 streams/journals/eor

Philipp Baumann Dorit S. Hochbaum An Algorithm for Clustering with Confidence-Based Must-Link and Cannot-Link Constraints. 1044-1068 2025 37 INFORMS J. Comput. 4 https://doi.org/10.1287/ijoc.2023.0419 db/journals/informs/informs37.html#BaumannH25 streams/journals/informs

Tamara Bigler Manuel Kammermann Philipp Baumann A matheuristic for a customer assignment problem in direct marketing. 689-708 2023 304 Eur. J. Oper. Res. 2 https://doi.org/10.1016/j.ejor.2022.04.009 db/journals/eor/eor304.html#BiglerKB23

Vanessa Tran Manuel Kammermann Philipp Baumann The MPFCC Algorithm: A Model-Based Approach for Fair-Capacitated Clustering. 677-681 2023 IEEM https://doi.org/10.1109/IEEM58616.2023.10406388 conf/ieem/2023 db/conf/ieem/ieem2023.html#TranKB23 Philipp Baumann Dorit S. Hochbaum A k-Means Algorithm for Clustering with Soft Must-link and Cannot-link Constraints. 195-202 2022 ICPRAM https://doi.org/10.5220/0010800000003122 conf/icpram/2022 db/conf/icpram/icpram2022.html#BaumannH22 Philipp Baumann FT-KMEANS: A Fast Algorithm For Fault-Tolerant Facility Location. 502-506 2022 IEEM https://doi.org/10.1109/IEEM55944.2022.9989850 conf/ieem/2022 db/conf/ieem/ieem2022.html#Baumann22

Philipp Baumann Dorit S. Hochbaum PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm. 2022 abs/2212.14437 CoRR https://doi.org/10.48550/arXiv.2212.14437 db/journals/corr/corr2212.html#abs-2212-14437

Mario Gnägi Philipp Baumann A matheuristic for large-scale capacitated clustering. 105304 2021 132 Comput. Oper. Res. https://doi.org/10.1016/j.cor.2021.105304 db/journals/cor/cor132.html#GnagiB21

Philipp Baumann Manuel Kammermann Silvan Elsaesser Minimizing Paper Waste and Setup Costs in Offset Printing. 858-862 2021 IEEM https://doi.org/10.1109/IEEM50564.2021.9673049 conf/ieem/2021 db/conf/ieem/ieem2021.html#BaumannKE21 Philipp Baumann A Binary Linear Programming-Based K-Means Algorithm For Clustering with Must-Link and Cannot-Link Constraints. 324-328 2020 IEEM https://doi.org/10.1109/IEEM45057.2020.9309775 conf/ieem/2020 db/conf/ieem/ieem2020.html#Baumann20 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. 615-619 2020 IEEM https://doi.org/10.1109/IEEM45057.2020.9309753 conf/ieem/2020 db/conf/ieem/ieem2020.html#SchoniBT20

Philipp Baumann Dorit S. Hochbaum Yan T. Yang A comparative study of the leading machine learning techniques and two new optimization algorithms. 1041-1057 2019 272 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2018.07.009 https://www.wikidata.org/entity/Q129412359 db/journals/eor/eor272.html#BaumannHY19

Philipp Baumann A Binary Linear Programming-Based K-Means Approach for the Capacitated Centered Clustering Problem. 335-339 2019 IEEM https://doi.org/10.1109/IEEM44572.2019.8978840 conf/ieem/2019 db/conf/ieem/ieem2019.html#Baumann19 Tamara Bigler Philipp Baumann Manuel Kammermann Optimizing Customer Assignments to Direct Marketing Activities: A Binary Linear Programming Formulation. 601-605 2019 IEEM https://doi.org/10.1109/IEEM44572.2019.8978863 conf/ieem/2019 db/conf/ieem/ieem2019.html#BiglerBK19

Oliver Strub Philipp Baumann Optimal construction and rebalancing of index-tracking portfolios. 370-387 2018 264 Eur. J. Oper. Res. 1 https://doi.org/10.1016/j.ejor.2017.06.055 db/journals/eor/eor264.html#StrubB18

Tom Rihm Philipp Baumann Staff assignment with lexicographically ordered acceptance levels. 167-189 2018 21 J. Sched. 2 https://doi.org/10.1007/s10951-017-0525-1 db/journals/scheduling/scheduling21.html#RihmB18

Philipp Baumann A Matheuristic for a Real-world Variant of the Multiple Traveling Salesman Problem. 1426-1430 2018 IEEM https://doi.org/10.1109/IEEM.2018.8607480 conf/ieem/2018 db/conf/ieem/ieem2018.html#Baumann18 Philipp Baumann Dorit S. Hochbaum Quico Spaen High-performance geometric algorithms for sparse computation in big data analytics. 546-555 2017 IEEE BigData https://doi.org/10.1109/BigData.2017.8257970 https://doi.ieeecomputersociety.org/10.1109/BigData.2017.8257970 conf/bigdataconf/2017 db/conf/bigdataconf/bigdataconf2017.html#BaumannHS17

Dorit S. Hochbaum Philipp Baumann Sparse Computation for Large-Scale Data Mining. 151-174 2016 2 IEEE Trans. Big Data 2 https://doi.org/10.1109/TBDATA.2016.2576470 http://doi.ieeecomputersociety.org/10.1109/TBDATA.2016.2576470 db/journals/tbd/tbd2.html#HochbaumB16

Philipp Baumann Dorit S. Hochbaum Quico Spaen Sparse-Reduced Computation - Enabling Mining of Massively-large Data Sets. 224-231 2016 ICPRAM https://doi.org/10.5220/0005690402240231 conf/icpram/2016 db/conf/icpram/icpram2016.html#BaumannHS16 Carlos Correa Shokiche Philipp Baumann Ruslan Hlushchuk Valentin Djonov Mauricio Reyes 0001 High-Throughput Glomeruli Analysis of μ CT Kidney Images Using Tree Priors and Scalable Sparse Computation. 370-378 2016 MICCAI (2) https://doi.org/10.1007/978-3-319-46723-8_43 conf/miccai/2016-2 db/conf/miccai/miccai2016-2.html#ShokicheBHDR16 Philipp Baumann Reynold J. Cooper Dorit S. Hochbaum Nidhi Patel Kunal Shalia Efficient deployment of mobile detectors for security applications. 214-218 2015 IEEM https://doi.org/10.1109/IEEM.2015.7385639 conf/ieem/2015 db/conf/ieem/ieem2015.html#BaumannCHPS15 Oliver Strub Philipp Baumann Index tracking using data-mining techniques and mixed-binary linear programming. 1208-1212 2015 IEEM https://doi.org/10.1109/IEEM.2015.7385839 conf/ieem/2015 db/conf/ieem/ieem2015.html#StrubB15 Tom Rihm Philipp Baumann Improving fairness in staff assignment: An approach for lexicographic goal programming. 1247-1251 2015 IEEM https://doi.org/10.1109/IEEM.2015.7385847 conf/ieem/2015 db/conf/ieem/ieem2015.html#RihmB15

Philipp Baumann Norbert Trautmann A hybrid method for large-scale short-term scheduling of make-and-pack production processes. 718-735 2014 236 Eur. J. Oper. Res. 2 https://doi.org/10.1016/j.ejor.2013.12.040 db/journals/eor/eor236.html#BaumannT14

Dorit S. Hochbaum Philipp Baumann Sparse computation for large-scale data mining. 354-363 2014 IEEE BigData https://doi.org/10.1109/BigData.2014.7004252 conf/bigdataconf/2014 db/conf/bigdataconf/bigdataconf2014.html#HochbaumB14 Philipp Baumann Norbert Trautmann Efficient symmetry-breaking formulations for grouping customer orders in a printing shop. 506-510 2014 IEEM https://doi.org/10.1109/IEEM.2014.7058689 conf/ieem/2014 db/conf/ieem/ieem2014.html#BaumannT14

Philipp Baumann Norbert Trautmann Portfolio-optimization models for small investors. 345-356 2013 77 Math. Methods Oper. Res. 3 https://doi.org/10.1007/s00186-012-0408-3 db/journals/mmor/mmor77.html#BaumannT13

Philipp Baumann Norbert Trautmann Heuristic decomposition and LP-based scheduling in make-and-pack production. 362-366 2011 IEEM https://doi.org/10.1109/IEEM.2011.6117939 conf/ieem/2011 db/conf/ieem/ieem2011.html#BaumannT11 Tamara Bigler Reynold J. Cooper Valentin Djonov Silvan Elsaesser Mario Gnägi Olivier Goldschmidt Ruslan Hlushchuk Dorit S. Hochbaum Manuel Kammermann Nidhi Patel Mauricio Reyes 0001 Tom Rihm Chantal Schöni Kunal Shalia Carlos Correa Shokiche Quico Spaen Oliver Strub Vanessa Tran Norbert Trautmann Jason Yang Yan T. Yang Y. Zhang