| Name | vpphard2 |
| Download | vpphard2.mps.gz |
| Solution | vpphard2.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | C. Cardonha |
| Rows | 198450 |
| Cols | 199999 |
| Num. non-zeros in A | 648340 |
| Num. non-zeros in c | 196600 |
| Rows/Cols | 0.992254961275 |
| Integers | |
| Binaries | 199999 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 81 |
| LP Objective | 0 |
| Aggregation | |
| Variable Bound | 17914 |
| Set partitioning | 592 |
| Set packing | |
| Set covering | |
| Cardinality | 333 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 135835 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |
Vehicle positioning problem instance. Solved using CPLEX 12.4 in 43987 seconds (May 2012). Solved using Gurobi 5.6.2 in 124 seconds (May 2014). Solved using CPLEX 12.6 in 225 seconds (May 2014).