| Name | vpphard |
| Download | vpphard.mps.gz |
| Solution | vpphard.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | C. Cardonha |
| Rows | 47280 |
| Cols | 51471 |
| Num. non-zeros in A | 372305 |
| Num. non-zeros in c | 46435 |
| Rows/Cols | 0.918575508539 |
| Integers | |
| Binaries | 51471 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 5 |
| LP Objective | 0 |
| Aggregation | |
| Variable Bound | 1237 |
| Set partitioning | 320 |
| Set packing | |
| Set covering | |
| Cardinality | 326 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 39286 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |
Vehicle positioning problem instance