| Name | acc-tight6 |
| Download | acc-tight6.mps.gz |
| Solution | acc-tight6.sol.gz |
| Set Membership | Primal Reoptimize |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | J. Walser |
| Rows | 3047 |
| Cols | 1335 |
| Num. non-zeros in A | 16108 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 2.28239700375 |
| Integers | |
| Binaries | 1335 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 0 |
| LP Objective | 0 |
| Aggregation | 3 |
| Variable Bound | 1690 |
| Set partitioning | 241 |
| Set packing | 248 |
| Set covering | 10 |
| Cardinality | 33 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 832 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 10 |
| General Cons. | |
| References |