| Name | nobel-eu-DBE |
| Download | nobel-eu-DBE.mps.gz |
| Solution | nobel-eu-DBE.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | C. Raack |
| Rows | 879 |
| Cols | 3771 |
| Num. non-zeros in A | 11313 |
| Num. non-zeros in c | 1639 |
| Rows/Cols | 0.233094669849 |
| Integers | |
| Binaries | 1639 |
| Continuous | 2132 |
| min nonzero |Aij| | 1 |
| max |Aij| | 77400 |
| min nonzero |cj| | 3150 |
| max |cj| | 3870000 |
| Integer Objective | 608910 |
| LP Objective | 570687.5 |
| Aggregation | 9 |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 41 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 870 |
| General Cons. | |
| References |