3 papers
math.OC2023
On the online path extension problem -- Location and routing problems in board games
Konstantin Kraus, Kathrin Klamroth, Michael Stiglmayr
We consider an online version of a longest path problem in an undirected and planar graph that is motivated by a location and routing problem occurring in the board game "Turn & Ta…
math.OC2023
Modeling Minimum Cost Network Flows With Port-Hamiltonian Systems
Onur Tanil Doganay, Kathrin Klamroth, Bruno Lang +2
We give a short overview of advantages and drawbacks of the classical formulation of minimum cost network flow problems and solution techniques, to motivate a reformulation of clas…
cs.LG2020
Efficient and Sparse Neural Networks by Pruning Weights in a Multiobjective Learning Approach
Malena Reiners, Kathrin Klamroth, Michael Stiglmayr
Overparameterization and overfitting are common concerns when designing and training deep neural networks, that are often counteracted by pruning and regularization strategies. How…