| Name | tanglegram2 |
| Download | tanglegram2.mps.gz |
| Solution | tanglegram2.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | F. Hüffner |
| Rows | 8980 |
| Cols | 4714 |
| Num. non-zeros in A | 26940 |
| Num. non-zeros in c | 4490 |
| Rows/Cols | 1.90496393721 |
| Integers | |
| Binaries | 4714 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 443 |
| LP Objective | 0 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | 6820 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 8980 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |