Online-Optimization of Large-Scale Vehicle Dispatching Problems. - Sleman Saliba; Sven Oliver Krumke; Stephan Westphal (Electron. Notes Discret. Math., 2006)

Competitive Algorithms for Cottage Rental. - Stephan Westphal; Sven Oliver Krumke; Rob van Stee (Electron. Notes Discret. Math., 2006)

Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem. - Kerstin Bauer; Thomas Fischer 003; Sven Oliver Krumke; Katharina Gerhardt; Stephan Westphal; Peter Merz (EvoCOP, 2008)

Pruning in column generation for service vehicle dispatching. - Stephan Westphal; Sven Oliver Krumke (Ann. Oper. Res., 2008)

A note on the k-Canadian Traveller Problem. - Stephan Westphal (Inf. Process. Lett., 2008)

Approximation algorithms for a vehicle routing problem. - Sven Oliver Krumke; Sleman Saliba; Tjark Vredeveld; Stephan Westphal (Math. Methods Oper. Res., 2008)

A monotone approximation algorithm for scheduling with precedence constraints. - Sven Oliver Krumke; Anne Schwahn; Rob van Stee; Stephan Westphal (Oper. Res. Lett., 2008)

New lower bounds for online k-server routing problems. - Irene Fink; Sven Oliver Krumke; Stephan Westphal (Inf. Process. Lett., 2009)

Approximating the Traveling Tournament Problem with Maximum Tour Length 2. - Clemens Thielen; Stephan Westphal (ISAAC (2), 2010)

MIP Formulations for Flowshop Scheduling with Limited Buffers. - Janick V. Frasch; Sven Oliver Krumke; Stephan Westphal (TAPAS, 2011)

Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines. - Sven Oliver Krumke; Alfred Taudes; Stephan Westphal (Comput. Oper. Res., 2011)

Interval scheduling on related machines. - Sven Oliver Krumke; Clemens Thielen; Stephan Westphal (Comput. Oper. Res., 2011)

Complexity of the traveling tournament problem. - Clemens Thielen; Stephan Westphal (Theor. Comput. Sci., 2011)

Approximation algorithms for TTP(2). - Clemens Thielen; Stephan Westphal (Math. Methods Oper. Res., 2012)

Online Job Admission. - Sven O. Krumke; Rob van Stee; Stephan Westphal (Fundamental Problems in Computing, 2013)

A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items. - Marco Bender; Clemens Thielen; Stephan Westphal (MFCS, 2013)

Complexity and approximability of the maximum flow problem with minimum quantities. - Clemens Thielen; Stephan Westphal (Networks, 2013)

Sports Scheduling: Minimizing Travel for English Football Supporters. - Graham Kendall; Stephan Westphal (Automated Scheduling and Planning, 2013)

Solving the Traveling Tournament Problem by Packing Three-Vertex Paths. - Marc Goerigk; Richard Hoshino; Ken-ichi Kawarabayashi; Stephan Westphal (AAAI, 2014)

Maximum Generalized Assignment with Convex Costs. - Marco Bender; Stephan Westphal (ISCO, 2014)

A 5.875-approximation for the Traveling Tournament Problem. - Stephan Westphal; Karl Noparlik (Ann. Oper. Res., 2014)

Scheduling the German Basketball League. - Stephan Westphal (Interfaces, 2014)

An application of deterministic and robust optimization in the wood cutting industry. - Jonas Ide; Morten Tiedemann; Stephan Westphal; Felix Haiduk (4OR, 2015)

Packing items into several bins facilitates approximating the separable assignment problem. - Marco Bender; Clemens Thielen; Stephan Westphal (Inf. Process. Lett., 2015)

An optimal randomized online algorithm for the k-Canadian Traveller Problem on node-disjoint paths. - Marco Bender; Stephan Westphal (J. Comb. Optim., 2015)

A column generation approach for optimized routing and coordination of a UAV fleet. - Julia Zillies; Stephan Westphal; Dinesh Thakur; Vijay Kumar 001; George J. Pappas; David Scheidt (SSRR, 2016)

A combined local search and integer programming approach to the traveling tournament problem. - Marc Goerigk; Stephan Westphal (Ann. Oper. Res., 2016)

The online knapsack problem with incremental capacity. - Clemens Thielen; Morten Tiedemann; Stephan Westphal (Math. Methods Oper. Res., 2016)

Online interval scheduling with a bounded number of failures. - Marco Bender; Clemens Thielen; Stephan Westphal (J. Sched., 2017)

Cross-provider Platoons for Same-day Delivery. - Sînziana-Maria Sebe; Philipp Kraus; Jörg P. Müller; Stephan Westphal (VEHITS, 2019)

Full implementation of social choice functions in dominant strategies. - Sven O. Krumke; Clemens Thielen; Philipp Weinschenk; Stephan Westphal (Int. J. Game Theory, 2019)

A Multi-Round Auction for Staff to Job Assignment Under Myopic Best Response Dynamics. - Felix Merz; Christoph Schwindt; Stephan Westphal; Jürgen Zimmermann 001 (IEEM, 2020)

A branch & bound algorithm to determine optimal cross-splits for decision tree induction. - Ferdinand Bollwein; Martin Dahmen; Stephan Westphal (Ann. Math. Artif. Intell., 2020)

Engineering Human-Machine Teams for Trusted Collaboration. - Basel Alhaji; Janine Beecken; Rüdiger Ehlers; Jan Gertheiss; Felix Merz; Jörg P. Müller; Michael Prilla; Andreas Rausch 001; Andreas Reinhardt 001; Delphine Reinhardt; Christian Rembe; Niels-Ole Rohweder; et al. (Big Data Cogn. Comput., 2020)

An Auction-based Mechanism for the Formation and Scheduling of Heterogeneous Human-machine Teams. - Felix Merz; Christoph Schwindt; Stephan Westphal; Jürgen Zimmermann 001 (IEEM, 2021)

A branch & bound algorithm to determine optimal bivariate splits for oblique decision tree induction. - Ferdinand Bollwein; Stephan Westphal (Appl. Intell., 2021)

Oblique decision tree induction by cross-entropy optimization based on the von Mises-Fisher distribution. - Ferdinand Bollwein; Stephan Westphal (Comput. Stat., 2022)