TY - UNPD
A1 - Hamacher, Horst W.
A1 - Kinscherff, Anika
T1 - An Integer Network Flow Problem with Bridge Capacities
N2 - In this paper a modified version of dynamic network
ows is discussed. Whereas dynamic network flows are widely analyzed already, we consider a dynamic flow problem with aggregate arc capacities called Bridge
Problem which was introduced by Melkonian [Mel07]. We extend his research to integer flows and show that this problem is strongly NP-hard. For practical relevance we also introduce and analyze the hybrid bridge problem, i.e. with underlying networks whose arc capacity can limit aggregate flow (bridge problem) or the flow entering an arc at each time (general dynamic flow). For this kind of problem we present efficient procedures for
special cases that run in polynomial time. Moreover, we present a heuristic for general hybrid graphs with restriction on the number of bridge arcs.
Computational experiments show that the heuristic works well, both on random graphs and on graphs modeling also on realistic scenarios.
T3 - Report in Wirtschaftsmathematik (WIMA Report) - 163
Y1 - 2017
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/4667
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-46674
ER -