| Name | pw-myciel4 |
| Download | pw-myciel4.mps.gz |
| Solution | pw-myciel4.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Koster |
| Rows | 8164 |
| Cols | 1059 |
| Num. non-zeros in A | 17779 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 7.70915958451 |
| Integers | 1 |
| Binaries | 1058 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 10 |
| LP Objective | 0 |
| Aggregation | |
| Variable Bound | 8096 |
| Set partitioning | 45 |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | 23 |
| References |
Model to compute the pathwidth of Mycielski-4 instance from DIMACS graph coloring database