|
1 |
Oblique decision tree induction by cross-entropy optimization based on the von Mises–Fisher distribution
Enthalten in Computational statistics 29.1.2022: 1-27
|
|
|
|
2 |
A branch & bound algorithm to determine optimal bivariate splits for oblique decision tree induction
Enthalten in Applied intelligence 12.3.2021: 1-21
|
|
|
3 |
New heuristics for finding optimal routes for vehicle platoons in road networks
Steinmetz, Dietrich. - Clausthal-Zellerfeld : Technische Universität Clausthal, 2020
|
|
|
|
4 |
A branch & bound algorithm to determine optimal cross-splits for decision tree induction
Enthalten in Annals of mathematics and artificial intelligence 3.1.2020: 1-21
|
|
|
|
5 |
Full implementation of social choice functions in dominant strategies
Enthalten in International journal of game theory 11.12.2018: 1-25
|
|
|
|
6 |
Online interval scheduling with a bounded number of failures
Enthalten in Journal of scheduling 13.1.2017: 1-15
|
|
|
|
7 |
Online Resource Management
Tiedemann, Morten. - Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2015
|
|
|
|
8 |
Complexity and Approximability of the Maximum Flow Problem with Minimum Quantities
Thielen, Clemens. - Kaiserslautern : Technische Universität Kaiserslautern, Fachbereich Mathematik, 2012
|
|
|
9 |
Aspects of online routing and scheduling
Westphal, Stephan. - München : Verl. Dr. Hut, 2007, 1. Aufl.
|
|
|
|
10 |
The online knapsack problem with incremental capacity
Enthalten in Mathematical methods of operations research Bd. 83, 30.12.2015, Nr. 2, date:4.2016: 207-242
|
|
Administration
