Multi-Commodity Disconnecting Sets

Published Online:https://doi.org/10.1287/mnsc.16.6.B427

A comparison of single-commodity versus multi-commodity networks is provided. Also, two combinatorial algorithms are presented for finding D0, the minimal disconnecting set.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.