Probabilistic Flow Covering Problem: Data and Results

<b>ohio.csv</b><br>Contains tabular network:a) column 1 = origin node id (integer)<br>b) column 2 = destination node id (integer)<br>c) column 3 = minimum number steps between od pair (a 1.0 indicates a direct connection, the network arcs) (integer)<br>d) column 4 = minimum distance between node pair (double)<br>e) column 5 = truck flow in car equivalents (integer)<br><br><b>shpfiles.7z</b><br>Contains arcs/nodes in .shp gis format:a) interstatenodes.shp - network nodesb) interstatearcs.shp - network arcsc) msabndry - boundary for metropolitan statistical areasd) ohiobndy.shp - boundary for the state of Ohio, USA<br>Results.7zContains:a) optimization input files in .lp format, named beta, lambda, alphab) gurobi log files in .txt format, named beta, lambda, alphac) the selected arcs for optimal solutions, named beta, lambda, alphad) WorkspaceGDB.gdb an arcgis geodatabase containing geographic files for the identified solutions.<br>