Sparsity pattern

rmatr200-p10

Namermatr200-p10
Downloadrmatr200-p10.mps.gz
Solutionrmatr200-p10.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorD. Krushinsky
Rows35055
Cols35254
Num. non-zeros in A105362
Num. non-zeros in c35254
Rows/Cols0.994355250468
Integers
Binaries200
Continuous35054
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|2424
Integer Objective2017
LP Objective1550.620783
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality1
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/135054
General Cons.
References GoldengorinKrushinsky2011

Instance coming from a formulation of the p-Median problem using square cost matrices. Solved by Gurobi 4.6.1 (12 threads) in 19644 seconds (January 2012).


Last Update February 28, 2017 by Gerald Gamrath
© 2017 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint