| Name | rococoC10-001000 |
| Download | rococoC10-001000.mps.gz |
| Solution | rococoC10-001000.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Chabrier, E. Danna, C. Le Pape, L. Perron |
| Rows | 1293 |
| Cols | 3117 |
| Num. non-zeros in A | 11751 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.414821944177 |
| Integers | 124 |
| Binaries | 2993 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 34000 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 11460 |
| LP Objective | 7515.271029 |
| Aggregation | |
| Variable Bound | 205 |
| Set partitioning | 66 |
| Set packing | |
| Set covering | |
| Cardinality | 264 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | 206 |
| References |