Search alternatives:
guided optimization » based optimization (Expand Search), model optimization (Expand Search)
location algorithm » selection algorithm (Expand Search), encryption algorithm (Expand Search), correction algorithm (Expand Search)
source location » resource allocation (Expand Search), source localization (Expand Search), source pollution (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data source » data sources (Expand Search)
binary wave » binary image (Expand Search)
wave guided » wire guided (Expand Search), image guided (Expand Search), curve guided (Expand Search)
guided optimization » based optimization (Expand Search), model optimization (Expand Search)
location algorithm » selection algorithm (Expand Search), encryption algorithm (Expand Search), correction algorithm (Expand Search)
source location » resource allocation (Expand Search), source localization (Expand Search), source pollution (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data source » data sources (Expand Search)
binary wave » binary image (Expand Search)
wave guided » wire guided (Expand Search), image guided (Expand Search), curve guided (Expand Search)
-
1
-
2
-
3
Min-Cut/Max-Flow Problem Instances for Benchmarking
Published 2022“…</p> </li></ul> </li></ul> </div><div><p>The reason for releasing this collection is to provide a single place download all datasets used in our paper (and various previous paper) instead of having to scavenge from multiple sources. Furthermore, several of the problem instances typically used for benchmarking min-cut/max-flow algorithms are no longer available at their original locations and may be difficult to find. …”