| Name | pigeon-10 |
| Download | pigeon-10.mps.gz |
| Solution | pigeon-10.sol.gz |
| Set Membership | Benchmark Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | S. Allen |
| Rows | 931 |
| Cols | 490 |
| Num. non-zeros in A | 8150 |
| Num. non-zeros in c | 10 |
| Rows/Cols | 1.9 |
| Integers | |
| Binaries | 400 |
| Continuous | 90 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1000 |
| min nonzero |cj| | 1000 |
| max |cj| | 1000 |
| Integer Objective | -9000 |
| LP Objective | -10000 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | 60 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 270 |
| Knapsacks | 1 |
| Integer Knapsack | |
| Mixed 0/1 | 600 |
| General Cons. | |
| References |