| Name | pigeon-13 |
| Download | pigeon-13.mps.gz |
| Solution | pigeon-13.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | S. Allen |
| Rows | 1561 |
| Cols | 754 |
| Num. non-zeros in A | 13871 |
| Num. non-zeros in c | 13 |
| Rows/Cols | 2.07029177719 |
| Integers | |
| Binaries | 637 |
| Continuous | 117 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1000 |
| min nonzero |cj| | 1000 |
| max |cj| | 1000 |
| Integer Objective | -12000 |
| LP Objective | -13000 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | 78 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 468 |
| Knapsacks | 1 |
| Integer Knapsack | |
| Mixed 0/1 | 1014 |
| General Cons. | |
| References |