| Name | tanglegram1 |
| Download | tanglegram1.mps.gz |
| Solution | tanglegram1.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | F. Hüffner |
| Rows | 68342 |
| Cols | 34759 |
| Num. non-zeros in A | 205026 |
| Num. non-zeros in c | 34171 |
| Rows/Cols | 1.96616703588 |
| Integers | |
| Binaries | 34759 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 5182 |
| LP Objective | 0 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | 60499 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 68342 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |