| Name | ns2081729 |
| Download | ns2081729.mps.gz |
| Solution | ns2081729.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | H. Mittelmann, Neos Server |
| Rows | 1190 |
| Cols | 661 |
| Num. non-zeros in A | 5680 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 1.80030257186 |
| Integers | |
| Binaries | 600 |
| Continuous | 61 |
| min nonzero |Aij| | 0.5 |
| max |Aij| | 100 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 9 |
| LP Objective | 4.6 |
| Aggregation | 30 |
| Variable Bound | 50 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 1110 |
| General Cons. | |
| References |