An augmenting-flow algorithm for a class of node-capacitated maximum flow problems

Robert M. Curry, J. Cole Smith

Research output: Contribution to journalArticlepeer-review

Abstract

We consider a class of maximum flow problems (MFPs) having node- and arc-capacity constraints, in which each unit of flow on arc (Formula presented.) consumes a positive amount of capacity at node i. This problem arises in wireless sensor network optimization applications, where node capacities refer to sensor energy limits. This version of the MFP is traditionally solved using linear programming due to the presence of the complicating node-capacity constraints. As an alternative scheme, we prescribe an approach for this problem based on augmenting flows along paths and cycles, showing why sending flows on augmenting cycles becomes necessary in this class of problems. Although our augmenting flow algorithm ultimately requires the solution of auxiliary linear programs, we demonstrate the computational advantages of our approach on randomly generated test instances.

Original languageEnglish (US)
JournalNetworks
DOIs
StateAccepted/In press - 2021

Keywords

  • linear programming
  • maximum flow problem
  • network optimization
  • node capacities

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'An augmenting-flow algorithm for a class of node-capacitated maximum flow problems'. Together they form a unique fingerprint.

Cite this