default search action
Stephan Westphal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j25]Ferdinand Bollwein
, Stephan Westphal:
Oblique decision tree induction by cross-entropy optimization based on the von Mises-Fisher distribution. Comput. Stat. 37(5): 2203-2229 (2022) - 2021
- [j24]Ferdinand Bollwein
A branch & bound algorithm to determine optimal bivariate splits for oblique decision tree induction. Appl. Intell. 51(10): 7552-7572 (2021) - [c11]Felix Merz, Christoph Schwindt, Stephan Westphal, Jürgen Zimmermann:
An Auction-based Mechanism for the Formation and Scheduling of Heterogeneous Human-machine Teams. IEEM 2021: 863-868 - 2020
- [j23]Ferdinand Bollwein
A branch & bound algorithm to determine optimal cross-splits for decision tree induction. Ann. Math. Artif. Intell. 88(4): 291-311 (2020) - [j22]Basel Alhaji, Janine Beecken, Rüdiger Ehlers
Engineering Human-Machine Teams for Trusted Collaboration. Big Data Cogn. Comput. 4(4): 35 (2020) - [c10]Felix Merz, Christoph Schwindt, Stephan Westphal, Jürgen Zimmermann:
A Multi-Round Auction for Staff to Job Assignment Under Myopic Best Response Dynamics. IEEM 2020: 1137-1141
2010 – 2019
- 2019
- [j21]Sven O. Krumke, Clemens Thielen
Full implementation of social choice functions in dominant strategies. Int. J. Game Theory 48(1): 337-361 (2019) - [c9]Sînziana-Maria Sebe, Philipp Kraus, Jörg P. Müller, Stephan Westphal:
Cross-provider Platoons for Same-day Delivery. VEHITS 2019: 106-116 - 2017
- [j20]Marco Bender, Clemens Thielen
Online interval scheduling with a bounded number of failures. J. Sched. 20(5): 443-457 (2017) - 2016
- [j19]Marc Goerigk
A combined local search and integer programming approach to the traveling tournament problem. Ann. Oper. Res. 239(1): 343-354 (2016) - [j18]Clemens Thielen
The online knapsack problem with incremental capacity. Math. Methods Oper. Res. 83(2): 207-242 (2016) - [c8]Julia Zillies, Stephan Westphal, Dinesh Thakur, Vijay Kumar, George J. Pappas
A column generation approach for optimized routing and coordination of a UAV fleet. SSRR 2016: 350-357 - 2015
- [j17]Jonas Ide, Morten Tiedemann, Stephan Westphal, Felix Haiduk:
An application of deterministic and robust optimization in the wood cutting industry. 4OR 13(1): 35-57 (2015) - [j16]Marco Bender, Clemens Thielen
Packing items into several bins facilitates approximating the separable assignment problem. Inf. Process. Lett. 115(6-8): 570-575 (2015) - [j15]Marco Bender, Stephan Westphal
An optimal randomized online algorithm for the k-Canadian Traveller Problem on node-disjoint paths. J. Comb. Optim. 30(1): 87-96 (2015) - 2014
- [j14]Stephan Westphal, Karl Noparlik:
A 5.875-approximation for the Traveling Tournament Problem. Ann. Oper. Res. 218(1): 347-360 (2014) - [j13]Stephan Westphal:
Scheduling the German Basketball League. Interfaces 44(5): 498-508 (2014) - [c7]Marc Goerigk, Richard Hoshino, Ken-ichi Kawarabayashi, Stephan Westphal:
Solving the Traveling Tournament Problem by Packing Three-Vertex Paths. AAAI 2014: 2271-2277 - [c6]Marco Bender, Stephan Westphal:
Maximum Generalized Assignment with Convex Costs. ISCO 2014: 75-86 - 2013
- [j12]Clemens Thielen
Complexity and approximability of the maximum flow problem with minimum quantities. Networks 62(2): 125-131 (2013) - [c5]Sven O. Krumke, Rob van Stee, Stephan Westphal
Online Job Admission. Fundamental Problems in Computing 2013: 435-454 - [c4]Marco Bender, Clemens Thielen
A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items. MFCS 2013: 135-145 - [p1]Graham Kendall, Stephan Westphal
Sports Scheduling: Minimizing Travel for English Football Supporters. Automated Scheduling and Planning 2013: 61-90 - 2012
- [j11]Clemens Thielen
Approximation algorithms for TTP(2). Math. Methods Oper. Res. 76(1): 1-20 (2012) - 2011
- [j10]Sven Oliver Krumke, Alfred Taudes
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines. Comput. Oper. Res. 38(8): 1103-1108 (2011) - [j9]Sven Oliver Krumke, Clemens Thielen
Interval scheduling on related machines. Comput. Oper. Res. 38(12): 1836-1844 (2011) - [j8]Clemens Thielen
Complexity of the traveling tournament problem. Theor. Comput. Sci. 412(4-5): 345-351 (2011) - [c3]Janick V. Frasch, Sven Oliver Krumke, Stephan Westphal
MIP Formulations for Flowshop Scheduling with Limited Buffers. TAPAS 2011: 127-138 - 2010
- [c2]Clemens Thielen
Approximating the Traveling Tournament Problem with Maximum Tour Length 2. ISAAC (2) 2010: 303-314
2000 – 2009
- 2009
- [j7]Irene Fink, Sven Oliver Krumke, Stephan Westphal
New lower bounds for online k-server routing problems. Inf. Process. Lett. 109(11): 563-567 (2009) - 2008
- [j6]Stephan Westphal
Pruning in column generation for service vehicle dispatching. Ann. Oper. Res. 159(1): 355-371 (2008) - [j5]Stephan Westphal
A note on the k-Canadian Traveller Problem. Inf. Process. Lett. 106(3): 87-89 (2008) - [j4]Sven Oliver Krumke, Sleman Saliba, Tjark Vredeveld, Stephan Westphal
Approximation algorithms for a vehicle routing problem. Math. Methods Oper. Res. 68(2): 333-359 (2008) - [j3]Sven Oliver Krumke, Anne Schwahn, Rob van Stee, Stephan Westphal
A monotone approximation algorithm for scheduling with precedence constraints. Oper. Res. Lett. 36(2): 247-249 (2008) - [c1]Kerstin Bauer, Thomas Fischer, Sven Oliver Krumke, Katharina Gerhardt, Stephan Westphal
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem. EvoCOP 2008: 158-169 - 2006
- [j2]Sleman Saliba, Sven Oliver Krumke, Stephan Westphal
Online-Optimization of Large-Scale Vehicle Dispatching Problems. Electron. Notes Discret. Math. 25: 145-146 (2006) - [j1]Stephan Westphal
Competitive Algorithms for Cottage Rental. Electron. Notes Discret. Math. 25: 187-188 (2006)
Coauthor Index
aka: Sven O. Krumke
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-09-04 01:21 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: