On the Complexity of the Maximum Minimum Cost Flow Problem

Please always quote using this URN: urn:nbn:de:0297-zib-73359
  • 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.

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Kai HoppmannORCiD
Document Type:ZIB-Report
Date of first Publication:2019/05/29
Series (Serial Number):ZIB-Report (19-19)
ISSN:1438-0064