TY - GEN
A1 - Hoppmann, Kai
T1 - On the Complexity of the Maximum Minimum Cost Flow Problem
N2 - Consider a flow network, i.e., a directed graph where each arc has a nonnegative capacity and an associated length, together with nonempty supply-intervals for the sources and nonempty demand-intervals for the sinks. The goal of the Maximum Minimum Cost Flow Problem (MMCF) is to find fixed supply and demand values within these intervals, such that the optimal objective value of the induced Minimum Cost Flow Problem (MCF) is maximized. In this paper, we show that MMCF is APX-hard and remains NP-hard in the uncapacitated case.
T3 - ZIB-Report - 19-19
Y1 - 2019
UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/7335
UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-73359
SN - 1438-0064
ER -