@inproceedings{db665d55676746eeb6ace3a3a25b55a2,

title = "A heuristic approach to a class of node-capacitated maximum flow problems",

abstract = "The node-capacitated maximum flow problem (NCMFP) seeks to determine a set of flows that maximize the total flow from a source s to a terminal t without violating any node- or arc-capacity constraints. The maximum allowable amount of flow on an arc is limited by its capacity. We also assume that each node has a non-negative capacity, and each unit of flow on an arc consumes a positive amount of capacity at the out-going node. Such problems arise in wireless sensor network optimization. Whereas this problem has traditionally been solved as a linear program (LP), we present a heuristic augmenting-flow algorithm that avoids solving any LPs to determine a quality NCMFP solution. Our approach iteratively identifies and augments flows along a combination of cycles and paths. We present computational results for comparing our heuristic with an LP for solving the NCMFP over a set of random test instances and detail future research directions.",

author = "Curry, {Robert M.} and {Cole Smith}, J.",

note = "Publisher Copyright: {\textcopyright} Proceedings of the 2020 IISE Annual. All Rights Reserved.; 2020 Institute of Industrial and Systems Engineers Annual Conference and Expo, IISE 2020 ; Conference date: 01-11-2020 Through 03-11-2020",

year = "2020",

language = "English (US)",

series = "Proceedings of the 2020 IISE Annual Conference",

publisher = "Institute of Industrial and Systems Engineers, IISE",

pages = "890--895",

editor = "L. Cromarty and R. Shirwaiker and P. Wang",

booktitle = "Proceedings of the 2020 IISE Annual Conference",

}