| Name | rococoB10-011000 |
| Download | rococoB10-011000.mps.gz |
| Solution | rococoB10-011000.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Chabrier, E. Danna, C. Le Pape, L. Perron |
| Rows | 1667 |
| Cols | 4456 |
| Num. non-zeros in A | 16517 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.374102333932 |
| Integers | 136 |
| Binaries | 4320 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1612 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 19449 |
| LP Objective | 8350.199468 |
| Aggregation | |
| Variable Bound | 180 |
| Set partitioning | 90 |
| Set packing | |
| Set covering | |
| Cardinality | 360 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | 226 |
| References |