Submitter Variables Constraints Density Status Group Objective MPS File
Dmitry Krushinsky 35254 35055 8.52561e-05 hard rmatr 2017 rmatr200-p10.mps.gz

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).

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 35254 35254
Constraints 35055 35055
Binaries 200 200
Integers 0 0
Continuous 35054 35054
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 8.52561e-05 8.52561e-05
Nonzeroes 105362 105362
Constraint Classification Properties
Original Presolved
Total 35055 35055
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 35054 35054
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.002850 0.002850 0.002850 0.002850
Variable % 0.567312 0.567312 0.567312 0.567312
Score 0.000028

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 2017 2017 0 0 0 - 2018-10-29 Solution imported from MIPLIB2010.
1 2017 2017 0 0 0 - 2018-10-11 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to rmatr200-p10 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 Variables Binaries Integers Continuous Constraints Nonz. Submitter Group Status Objective
rmatr200-p5 37816 200 0 37616 37617 113048 Dmitry Krushinsky rmatr easy 4521.00
rmatr200-p20 29605 200 0 29405 29406 88415 Dmitry Krushinsky rmatr hard 837.00
rmatr100-p5 8784 100 0 8684 8685 26152 Dmitry Krushinsky rmatr easy 976.00
rmatr100-p10 7359 100 0 7259 7260 21877 Dmitry Krushinsky rmatr easy 423.00
neos-3665875-lesum 3128 320 0 2808 3184 10640 Jeff Linderoth neos-pseudoapplication-9 easy 3274.81

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}
}

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