| Name | tw-myciel4 |
| Download | tw-myciel4.mps.gz |
| Set Membership | Challenge |
| Problem Status | Open |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Koster |
| Rows | 8146 |
| Cols | 760 |
| Num. non-zeros in A | 27961 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 10.7184210526 |
| Integers | 1 |
| Binaries | 759 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | Unknown |
| LP Objective | 3.838028 |
| Aggregation | 71 |
| Variable Bound | 688 |
| Set partitioning | |
| Set packing | |
| Set covering | 1771 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 7364 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | 23 |
| References |
Model to compute the treewidth of the Mycielski-4 instance from the DIMACS graph coloring database