%0 Journal Article %1 journals/cor/CuretDG02 %A Curet, Norman D. %A DeVinney, Jason %A Gaston, Matthew E. %D 2002 %J Computers & OR %K dblp %N 3 %P 205-219 %T An efficient network flow code for finding all minimum cost s-t cutsets. %U http://dblp.uni-trier.de/db/journals/cor/cor29.html#CuretDG02 %V 29

@article{journals/cor/CuretDG02, added-at = {2006-02-20T00:00:00.000+0100}, author = {Curet, Norman D. and DeVinney, Jason and Gaston, Matthew E.}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2b0296de92ad29b5e0f7abace5d3df232/dblp}, ee = {http://dx.doi.org/10.1016/S0305-0548(00)00058-7}, interhash = {fd814dc4915b7f7d6412b026c10bbc38}, intrahash = {b0296de92ad29b5e0f7abace5d3df232}, journal = {Computers & OR}, keywords = {dblp}, number = 3, pages = {205-219}, timestamp = {2016-02-02T09:28:31.000+0100}, title = {An efficient network flow code for finding all minimum cost s-t cutsets.}, url = {http://dblp.uni-trier.de/db/journals/cor/cor29.html#CuretDG02}, volume = 29, year = 2002 }