A Row Generation Scheme for Finding a Multi-Commodity Minimum Disconnecting Set

Yash P. Aneja and R. R. Vemuganti
Additional contact information
Yash P. Aneja: University of New Brunswick
R. R. Vemuganti: University of Baltimore

Management Science, 1977, vol. 23, issue 6, 652-659

Abstract: The multi-commodity minimum disconnecting set in a given network is of considerable interest in military operations. The present known methods of finding the multi-commodity minimum disconnecting set consist of implicit enumeration techniques or techniques which involve the solution of several specially structured linear integer programs known as set-covering problems. In this paper we present an efficient method of finding the multi-commodity minimum disconnecting set by solving a single set-covering problem. Extensions and computational experience are also discussed.

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.6.652 (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:23:y:1977:i:6:p:652-659

Access Statistics for this article

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