| Name | enlight13 |
| Download | enlight13.mps.gz |
| Solution | enlight13.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Zymolka |
| Rows | 169 |
| Cols | 338 |
| Num. non-zeros in A | 962 |
| Num. non-zeros in c | 169 |
| Rows/Cols | 0.5 |
| Integers | 169 |
| Binaries | 169 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 2 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 71 |
| LP Objective | 0 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | 169 |
| References |
Model to solve instance of a combinatorial game ``EnLight''