| Name | gmu-35-40 |
| Download | gmu-35-40.mps.gz |
| Solution | gmu-35-40.sol.gz |
| Set Membership | Benchmark Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | N. Konnyu |
| Rows | 424 |
| Cols | 1205 |
| Num. non-zeros in A | 4843 |
| Num. non-zeros in c | 687 |
| Rows/Cols | 0.351867219917 |
| Integers | |
| Binaries | 1200 |
| Continuous | 5 |
| min nonzero |Aij| | 0.8 |
| max |Aij| | 2574.305 |
| min nonzero |cj| | 2694.614 |
| max |cj| | 158053.2 |
| Integer Objective | -2406733.3688 |
| LP Objective | -2406943.556343 |
| Aggregation | |
| Variable Bound | 32 |
| Set partitioning | |
| Set packing | 379 |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 13 |
| General Cons. | |
| References |
Timber harvest scheduling model