| Name | seymour-disj-10 |
| Download | seymour-disj-10.mps.gz |
| Solution | seymour-disj-10.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | M. Ferris, G. Pataki, S. Schmieta |
| Rows | 5108 |
| Cols | 1209 |
| Num. non-zeros in A | 64704 |
| Num. non-zeros in c | 1209 |
| Rows/Cols | 4.22497932175 |
| Integers | |
| Binaries | 1209 |
| Continuous | |
| min nonzero |Aij| | 1.003048e-08 |
| max |Aij| | 9 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 287 |
| LP Objective | 280.817818 |
| Aggregation | |
| Variable Bound | 270 |
| Set partitioning | |
| Set packing | |
| Set covering | 4538 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 4649 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 300 |
| General Cons. | |
| References |