Optimum Network Partitioning

Paul A. Jensen
Additional contact information
Paul A. Jensen: The University of Texas, Austin, Texas

Operations Research, 1971, vol. 19, issue 4, 916-932

Abstract: The problem of finding the optimum partition of a set of objects into disjoint collectively exhaustive subsets has been treated by several authors as a special set-covering problem. This paper considers this problem when the objects can be represented as nodes in a directed acyclical network and the subsets of the partition define subnetworks of the original network. A dynamic-programming algorithm is presented that solves the latter problem. This algorithm is, in some important cases, more efficient than the implicit-enumeration schemes that have been previously proposed for the more general set-partitioning problem.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.4.916 (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:oropre:v:19:y:1971:i:4:p:916-932

Access Statistics for this article

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