neos-1605075
Name | neos-1605075 |
Download | neos-1605075.mps.gz |
Solution | neos-1605075.sol.gz |
Set Membership |
Reoptimize
|
Problem Status | Easy |
Problem Feasibility | Feasible |
Originator/Contributor | NEOS Server Submission |
Rows | 3467 |
Cols | 4173 |
Num. non-zeros in A | 91377 |
Num. non-zeros in c | 528 |
Rows/Cols | 0.83081715792 |
Integers | |
Binaries | 3633 |
Continuous | 540 |
min nonzero |Aij| | 1 |
max |Aij| | 1 |
min nonzero |cj| | 1 |
max |cj| | 10000 |
Integer Objective | 9 |
LP Objective | 3.214461 |
Aggregation | |
Variable Bound | |
Set partitioning | 368 |
Set packing | |
Set covering | 5 |
Cardinality | 189 |
Equality Knapsacks | |
Bin packing | |
Invariant Knapsack | 5 |
Knapsacks | |
Integer Knapsack | |
Mixed 0/1 | 2905 |
General Cons. | |
References |
|