Decomposition methods for discrete optimization problems
Many combinatorial optimization problems can be solved efficiently on specially structured graphs by using algorithms based on decompositions of these graphs. Some decomposition approaches (e.g. branchwidth) can be generalized to hypergraphs, matroids, and symmetric submodular functions. We want to transfer these results to problems arising in rolling stock rostering where additional side constraints have to be taken into account.
Publications
2015
2014
2015 |
|||
Isabel Beckenbach, Ralf Borndörfer, Loes Knoben, David Kretz, Marc J. Uetz | The S-Bahn Challenge in Berlin | OR News, pp. 10-14, 2015 (preprint available as ) |
BibTeX
|
2014 |
|||
Isabel Beckenbach, Ralf Borndörfer | An Approximation Result for Matchings in Partitioned Hypergraphs | ZIB-Report 14-30 (Appeared in: Operations Research Proceedings 2014 (2016) pp. 31-36.) |
PDF
BibTeX URN DOI |