| Name | ramos3 |
| Download | ramos3.mps.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Open |
| Problem Feasibility | Feasible |
| Originator/Contributor | F. Ramos |
| Rows | 2187 |
| Cols | 2187 |
| Num. non-zeros in A | 32805 |
| Num. non-zeros in c | 2187 |
| Rows/Cols | 1.0 |
| Integers | |
| Binaries | 2187 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | Unknown |
| LP Objective | 145.8 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 2187 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |
Set covering problem from a product manufacturing application