| Name | danoint |
| Download | danoint.mps.gz |
| Solution | danoint.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | D. Bienstock |
| Rows | 664 |
| Cols | 521 |
| Num. non-zeros in A | 3232 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 1.27447216891 |
| Integers | |
| Binaries | 56 |
| Continuous | 465 |
| min nonzero |Aij| | 0.5 |
| max |Aij| | 66.5 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 65.666666667 |
| LP Objective | 62.63728 |
| Aggregation | |
| Variable Bound | 400 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | 16 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 248 |
| General Cons. | |
| References |