Submitter Variables Constraints Density Status Group Objective MPS File
Dmitry Krushinsky 7359 7260 4.0948e-04 easy rmatr 423 rmatr100-p10.mps.gz

Instance coming from a formulation of the p-Median problem using square cost matrices

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 7359 7359
Constraints 7260 7260
Binaries 100 100
Integers 0 0
Continuous 7259 7259
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00040948 0.00040948
Nonzeroes 21877 21877
Constraint Classification Properties
Original Presolved
Total 7260 7260
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 7259 7259
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.0137741 0.0137741 0.0137741 0.0137741
Variable % 1.3588800 1.3588800 1.3588800 1.3588800
Score 0.000136

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

Similar instances in collection

The following instances are most similar to rmatr100-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
rmatr100-p5 8784 100 0 8684 8685 26152 Dmitry Krushinsky rmatr easy 976.00
rmatr200-p20 29605 200 0 29405 29406 88415 Dmitry Krushinsky rmatr hard 837.00
rmatr200-p10 35254 200 0 35054 35055 105362 Dmitry Krushinsky rmatr hard 2017.00
rmatr200-p5 37816 200 0 37616 37617 113048 Dmitry Krushinsky rmatr easy 4521.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