Erratum

Published Online:https://doi.org/10.1287/moor.8.3.478

In (Anderson, E. J., P. Nash, A. B. Philpott. 1982. A class of continuous network flow problems. Math. Oper. Res.7 501–514, §5), we state two corollaries to a continuous maximum flow-minimum cut theorem. The second corollary is incorrect, owing to an implicit assumption that the optimal cut is unique.

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.