Implementing the Network Simplex for Hypergraphs
- The well-known network simplex algorithm is a powerful tool to solve flow problems on graphs. Based on a recent dissertation by Isabel Beckenbach, we develop the necessary theory to extend the network simplex to capacitated flow problems on hypergraphs and implement this new variant. We then attempt to solve instances arising from real-life vehicle rotation planning problems.
Additional Services
| Author: | Fabian Löbel |
|---|---|
| Document Type: | Master's Thesis |
| Granting Institution: | Freie Universität Berlin |
| Advisor: | Ralf Borndörfer, Niels Lindner, Boris Grimm |
| Date of final exam: | 2020/01/09 |
| Year of first publication: | 2020 |
