Norman D. Curet, Jason DeVinney, Matthew E. Gaston. An efficient network flow code for finding all minimum cost ::::s::::-::::t:::: cutsets. Computers & OR, 29(3):205-219, 2002. [doi]
@article{CuretDG02,
title = {An efficient network flow code for finding all minimum cost ::::s::::-::::t:::: cutsets},
author = {Norman D. Curet and Jason DeVinney and Matthew E. Gaston},
year = {2002},
doi = {10.1016/S0305-0548(00)00058-7},
url = {http://dx.doi.org/10.1016/S0305-0548(00)00058-7},
tags = {data-flow, e-science},
researchr = {https://researchr.org/publication/CuretDG02},
cites = {0},
citedby = {0},
journal = {Computers & OR},
volume = {29},
number = {3},
pages = {205-219},
}