| Name | eil33-2 |
| Download | eil33-2.mps.gz |
| Solution | eil33-2.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | J. Linderoth |
| Rows | 32 |
| Cols | 4516 |
| Num. non-zeros in A | 44243 |
| Num. non-zeros in c | 4516 |
| Rows/Cols | 0.00708591674048 |
| Integers | |
| Binaries | 4516 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 68.8767 |
| max |cj| | 413.2515 |
| Integer Objective | 934.007916 |
| LP Objective | 811.278996 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | 32 |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |