Asset Details
Do you wish to reserve the book?
A Row Generation Scheme for Finding a Multi-Commodity Minimum Disconnecting Set
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A Row Generation Scheme for Finding a Multi-Commodity Minimum Disconnecting Set
Do you wish to request the book?
A Row Generation Scheme for Finding a Multi-Commodity Minimum Disconnecting Set
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
A Row Generation Scheme for Finding a Multi-Commodity Minimum Disconnecting Set
1977
Overview
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.
Publisher
INFORMS,Institute of Management Sciences,Institute for Operations Research and the Management Sciences
