2 papers
math.OC2019
Case study on scheduling cyclic conveyor belts
Felix Bock, Henning Bruhn
We optimise the production line of a manufacturing company in southern Germany in order to improve throughput. While the optimisation problem is NP-hard in general, analysing produ…
math.CO2018
The matching number of tree and bipartite degree sequences
F. Bock, D. Rautenbach
We study the possible values of the matching number among all trees with a given degree sequence as well as all bipartite graphs with a given bipartite degree sequence. For tree de…