Algorithmic results for potential‐based flows: Easy and hard cases
Abstract
Potential‐based flows are an extension of classical network flows in which the flow on an arc is determined by the difference of the potentials of its incident nodes. Such flows are unique and arise, for example, in energy networks. Two important algorithmic problems are to determine whether there exists a feasible flow and to maximize the flow between two designated nodes. We show that these problems can be solved for the single source and sink case by reducing the network to a single arc. However, if we additionally consider switches that allow to force the flow to 0 and decouple the potentials, these problems are NP‐hard. Nevertheless, for particular series‐parallel networks, one can use algorithms for the subset sum problem. Moreover, applying network presolving based on generalized series‐parallel structures allows to significantly reduce the size of realistic energy networks.Keywords
Funding Information
- Bayerisches Staatsministerium für Wirtschaft und Medien, Energie und Technologie
- Deutsche Forschungsgemeinschaft (TRR 154)
- Einstein Stiftung Berlin
This publication has 35 references indexed in Scilit:
- Nonlinear Programming Techniques for Operative Planning in Large Drinking Water NetworksThe Open Applied Mathematics Journal, 2009
- A polyhedral branch-and-cut approach to global optimizationMathematical Programming, 2005
- How bad is selfish routing?Journal of the ACM, 2002
- Linear Time Algorithms for Knapsack Problems with Bounded WeightsJournal of Algorithms, 1999
- Braess's paradox and power-law nonlinearities in networksThe Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1993
- Paradoxical behaviour of mechanical and electrical networksNature, 1991
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974
- Über ein Paradoxon aus der VerkehrsplanungMathematical Methods of Operations Research, 1968