| Name | rococoC11-011100 |
| Download | rococoC11-011100.mps.gz |
| Solution | rococoC11-011100.sol.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Chabrier, E. Danna, C. Le Pape, L. Perron |
| Rows | 2367 |
| Cols | 6491 |
| Num. non-zeros in A | 30472 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.364658758281 |
| Integers | 166 |
| Binaries | 6325 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 4102 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 20889 |
| LP Objective | 9024.205406 |
| Aggregation | 220 |
| Variable Bound | 165 |
| Set partitioning | 110 |
| Set packing | |
| Set covering | |
| Cardinality | 495 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 55 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | 221 |
| References |