| Name | pigeon-12 |
| Download | pigeon-12.mps.gz |
| Solution | pigeon-12.sol.gz |
| Set Membership | Challenge Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | S. Allen |
| Rows | 1333 |
| Cols | 660 |
| Num. non-zeros in A | 11796 |
| Num. non-zeros in c | 12 |
| Rows/Cols | 2.0196969697 |
| Integers | |
| Binaries | 552 |
| Continuous | 108 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1000 |
| min nonzero |cj| | 1000 |
| max |cj| | 1000 |
| Integer Objective | -11000 |
| LP Objective | -12000 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | 72 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 396 |
| Knapsacks | 1 |
| Integer Knapsack | |
| Mixed 0/1 | 864 |
| General Cons. | |
| References |