TY - GEN
A1 - Beckenbach, Isabel
T1 - A Hypergraph Network Simplex Algorithm
N2 - We describe a network simplex algorithm for the minimum cost flow problem on graph-based hypergraphs which are directed hypergraphs of a particular form occurring in railway rotation planning. The algorithm is based on work of Cambini, Gallo, and Scutellà who developed a hypergraphic generalization of the network simplex algorithm. Their main theoretical result is the characterization of basis matrices. We give a similar characterization for graph-based hypergraphs and show that some operations of the simplex algorithm can be done combinatorially by exploiting the underlying digraph structure.
T3 - ZIB-Report - 17-36
Y1 - 2017
UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/6453
UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-64539
SN - 1438-0064
ER -