Optimization Online


Algorithmic Results for Potential-Based Flows: Easy and Hard Cases

Martin Groß (mgrob***at***uwaterloo.ca)
Marc E. Pfetsch (pfetsch***at***opt.tu-darmstadt.de)
Lars Schewe (lars.schewe***at***fau.de)
Martin Schmidt (mar.schmidt***at***fau.de)
Martin Skutella (martin.skutella***at***tu-berlin.de)

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: Potential networks, Potential-based flows, Maximum flow problem, Series-parallel graphs, Network reduction, NP-hardness

Category 1: Network Optimization

Category 2: Integer Programming

Category 3: Applications -- Science and Engineering


Download: [PDF]

Entry Submitted: 08/04/2017
Entry Accepted: 08/29/2017
Entry Last Modified: 05/31/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society