default search action
Philipp Baumann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j8]Tamara Bigler
, Manuel Kammermann, Philipp Baumann:
A matheuristic for a customer assignment problem in direct marketing. Eur. J. Oper. Res. 304(2): 689-708 (2023) - [c18]Vanessa Tran, Manuel Kammermann, Philipp Baumann:
The MPFCC Algorithm: A Model-Based Approach for Fair-Capacitated Clustering. IEEM 2023: 677-681 - 2022
- [c17]Philipp Baumann, Dorit S. Hochbaum:
A k-Means Algorithm for Clustering with Soft Must-link and Cannot-link Constraints. ICPRAM 2022: 195-202 - [c16]Philipp Baumann:
FT-KMEANS: A Fast Algorithm For Fault-Tolerant Facility Location. IEEM 2022: 502-506 - [i1]Philipp Baumann, Dorit S. Hochbaum:
PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm. CoRR abs/2212.14437 (2022) - 2021
- [j7]Mario Gnägi, Philipp Baumann
A matheuristic for large-scale capacitated clustering. Comput. Oper. Res. 132: 105304 (2021) - [c15]Philipp Baumann, Manuel Kammermann, Silvan Elsaesser:
Minimizing Paper Waste and Setup Costs in Offset Printing. IEEM 2021: 858-862 - 2020
- [c14]Philipp Baumann:
A Binary Linear Programming-Based K-Means Algorithm For Clustering with Must-Link and Cannot-Link Constraints. IEEM 2020: 324-328 - [c13]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: 615-619
2010 – 2019
- 2019
- [j6]Philipp Baumann
A comparative study of the leading machine learning techniques and two new optimization algorithms. Eur. J. Oper. Res. 272(3): 1041-1057 (2019) - [c12]Philipp Baumann:
A Binary Linear Programming-Based K-Means Approach for the Capacitated Centered Clustering Problem. IEEM 2019: 335-339 - [c11]Tamara Bigler
Optimizing Customer Assignments to Direct Marketing Activities: A Binary Linear Programming Formulation. IEEM 2019: 601-605 - 2018
- [j5]Oliver Strub
Optimal construction and rebalancing of index-tracking portfolios. Eur. J. Oper. Res. 264(1): 370-387 (2018) - [j4]Tom Rihm
Staff assignment with lexicographically ordered acceptance levels. J. Sched. 21(2): 167-189 (2018) - [c10]Philipp Baumann:
A Matheuristic for a Real-world Variant of the Multiple Traveling Salesman Problem. IEEM 2018: 1426-1430 - 2017
- [c9]Philipp Baumann, Dorit S. Hochbaum, Quico Spaen:
High-performance geometric algorithms for sparse computation in big data analytics. IEEE BigData 2017: 546-555 - 2016
- [j3]Dorit S. Hochbaum, Philipp Baumann
Sparse Computation for Large-Scale Data Mining. IEEE Trans. Big Data 2(2): 151-174 (2016) - [c8]Philipp Baumann, Dorit S. Hochbaum, Quico Spaen:
Sparse-Reduced Computation - Enabling Mining of Massively-large Data Sets. ICPRAM 2016: 224-231 - [c7]Carlos Correa Shokiche, Philipp Baumann, Ruslan Hlushchuk
High-Throughput Glomeruli Analysis of μ CT Kidney Images Using Tree Priors and Scalable Sparse Computation. MICCAI (2) 2016: 370-378 - 2015
- [c6]Philipp Baumann, Reynold J. Cooper
Efficient deployment of mobile detectors for security applications. IEEM 2015: 214-218 - [c5]Oliver Strub, Philipp Baumann:
Index tracking using data-mining techniques and mixed-binary linear programming. IEEM 2015: 1208-1212 - [c4]Tom Rihm
Improving fairness in staff assignment: An approach for lexicographic goal programming. IEEM 2015: 1247-1251 - 2014
- [j2]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): 718-735 (2014) - [c3]Dorit S. Hochbaum, Philipp Baumann:
Sparse computation for large-scale data mining. IEEE BigData 2014: 354-363 - [c2]Philipp Baumann, Norbert Trautmann
Efficient symmetry-breaking formulations for grouping customer orders in a printing shop. IEEM 2014: 506-510 - 2013
- [j1]Philipp Baumann, Norbert Trautmann
Portfolio-optimization models for small investors. Math. Methods Oper. Res. 77(3): 345-356 (2013) - 2011
- [c1]Philipp Baumann, Norbert Trautmann
Heuristic decomposition and LP-based scheduling in make-and-pack production. IEEM 2011: 362-366
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: