rmatr200-p20

cardinality mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
Dmitry Krushinsky 29605 29406 1.01561e-04 hard rmatr 837 rmatr200-p20.mps.gz

Instance coming from a formulation of the p-Median problem using square cost matrices. Solved using ug[SCIP/spx], a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility.

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 29605 29605
Constraints 29406 29406
Binaries 200 200
Integers 0 0
Continuous 29405 29405
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000101561 0.000101561
Nonzeroes 88415 88415
Constraint Classification Properties
Original Presolved
Total 29406 29406
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 0 0
Variable Bound 0 0
Set Partitioning 0 0
Set Packing 0 0
Set Covering 0 0
Cardinality 1 1
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 29405 29405
General Linear 0 0
Indicator 0 0

Structure

Available nonzero structure and decomposition information. Further information can be found here.

value min median mean max
Components 0.301030
Constraint % 0.003400 0.003400 0.003400 0.003400
Variable % 0.675562 0.675562 0.675562 0.675562
Score 0.000034

Best Known Solution(s)

Find solutions below. Download the archive containing all solutions from the Download page.

ID Objective Exact Int. Viol Cons. Viol Obj. Viol Submitter Date Description
2 1 837 837 0 0 0 - 2018-10-12 Solution imported from MIPLIB2010.
1 2 837 837 0 0 0 - 2018-10-12 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to rmatr200-p20 in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.

Instance Status Variables Binaries Integers Continuous Constraints Nonz. Submitter Group Objective Tags
rmatr200-p10 hard 35254 200 0 35054 35055 105362 Dmitry Krushinsky rmatr 2017 cardinality mixed_binary
rmatr200-p5 easy 37816 200 0 37616 37617 113048 Dmitry Krushinsky rmatr 4521 benchmark benchmark_suitable cardinality mixed_binary
rmatr100-p5 easy 8784 100 0 8684 8685 26152 Dmitry Krushinsky rmatr 976 benchmark_suitable cardinality mixed_binary
rmatr100-p10 easy 7359 100 0 7259 7260 21877 Dmitry Krushinsky rmatr 423 benchmark benchmark_suitable cardinality mixed_binary
neos-3665875-lesum easy 3128 320 0 2808 3184 10640 Jeff Linderoth neos-pseudoapplication-9 3274.81 benchmark_suitable set_covering invariant_knapsack mixed_binary

Reference

@article{GoldengorinKrushinsky2011,
 author = {B. Goldengorin and D. Krushinsky},
 journal = {Mathematical and Computer Modelling},
 number = {9--10},
 pages = {1719--1736},
 title = {Complexity evaluation of benchmark instances for the p-median problem},
 volume = {53},
 year = {2011}
}

@techreport{ShinanoAchterbergBertholdHeinzKoch2010TR,
 author = {Yuji Shinano and Tobias Achterberg and Timo Berthold and
Stefan Heinz and Thorsten Koch},
 institution = {Zuse Institute Berlin},
 number = {ZR 10-27},
 title = {Para{SCIP} -- a parallel extension of {SCIP}},
 year = {2010}
}

Last Update Jun 24, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint