The Cut Search Algorithm with Arc Capacities and Lower Bounds

Steve Phillips, Jr. and Mohamed I. Dessouky
Additional contact information
Steve Phillips, Jr.: University of Texas at Arlington
Mohamed I. Dessouky: University of Illinois

Management Science, 1979, vol. 25, issue 4, 396-404

Abstract: This paper presents a computational procedure for solving maximal flow problems in flow networks subject to positive upper bound or capacity constraints and lower bound restrictions that are equal to or greater than zero. This procedure, referred to as the cut search algorithm, locates directly the minimal cut in a flow network structure. The algorithm not only has demonstrated computational efficiency over the existing out-of-kilter procedure, but also it provides a direct solution routine for project time/cost tradeoff problems and other network cut based problem situations in which the restricting arcs of the network formulation must be located.

Keywords: project management; networks/graphs: flow algorithms (search for similar items in EconPapers)
Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.25.4.396 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:25:y:1979:i:4:p:396-404

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().