| Name | aflow30a |
| Download | aflow30a.mps.gz |
| Solution | aflow30a.sol.gz |
| Orginator | Tobias Achterberg |
| Formulator | Tobias Achterberg |
| Donator | Tobias Achterberg |
| Rows | 479 |
| Cols | 842 |
| Non-zeros | 2091 |
| Integers | |
| Binaries | 421 |
| Continuous | |
| |Min| | 1.00000000e+00 |
| |Max| | 1.00000000e+02 |
| Integer Objective | 1.15800000e+03 |
| LP Objective | 9.83167425e+02 |
| Root LP Basis | aflow30a.bas.gz |
| Set partitioning | 10 |
| Set packing | |
| Set covering | |
| Cardinality | 19 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Upper bounds | |
| Lower bounds | 421 |
| Mixed 0/1 | 29 |
| General Cons. | |
| References | Pfender2000 AchterbergKochMartin2005 |
arborescence flow problem on a random graph with 30 nodes and an edge density of 0.5