50v-10

benchmark decomposition benchmark_suitable mixed_binary general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Serge Bisaillon 2013 233 5.85252e-03 easy 3311.1799841 50v-10.mps.gz

Network loading instance. 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 2013 2013
Constraints 233 233
Binaries 1464 1464
Integers 183 183
Continuous 366 366
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00585252 0.00585252
Nonzeroes 2745 2745
Constraint Classification Properties
Original Presolved
Total 233 233
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 0 0
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 50 50
General Linear 183 183
Indicator 0 0

Structure

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

value min median mean max
Components 2.167317
Constraint % 0.429185 0.567347 0.429185 6.86695
Variable % 0.546448 0.684932 0.546448 7.10383
Score 0.815990

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

Similar instances in collection

The following instances are most similar to 50v-10 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
mc11 easy 3040 1520 0 1520 1920 6080 F. Ortega, L. Wolsey mc 11689 benchmark decomposition benchmark_suitable variable_bound mixed_binary
mc8 easy 3040 1520 0 1520 1920 6080 F. Ortega, L. Wolsey mc 1566 decomposition benchmark_suitable variable_bound mixed_binary
mc7 easy 3040 1520 0 1520 1920 6080 F. Ortega, L. Wolsey mc 3417 decomposition benchmark_suitable variable_bound mixed_binary
beasleyC3 easy 2500 1250 0 1250 1750 5000 F. Ortega, L. Wolsey beasley 754 benchmark decomposition benchmark_suitable aggregations variable_bound mixed_binary
g200x740 easy 1480 740 0 740 940 2960 MIPLIB submission pool fixed-cost-network-flow 44316 decomposition benchmark_suitable variable_bound mixed_binary

Reference

@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 Mär 19, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint