| Name | ash608gpia-3col |
| Download | ash608gpia-3col.mps.gz |
| Set Membership | Benchmark Infeasible |
| Problem Status | Easy |
| Problem Feasibility | Infeasible |
| Originator/Contributor | M. Pfetsch |
| Rows | 24748 |
| Cols | 3651 |
| Num. non-zeros in A | 74244 |
| Num. non-zeros in c | 3 |
| Rows/Cols | 6.77841687209 |
| Integers | |
| Binaries | 3651 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | Infeasible |
| LP Objective | 2 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | 1216 |
| Set packing | 23532 |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |
Infeasible and highly symmetric graph 3-coloring assignment formulation