n2seq36f

binary decomposition benchmark_suitable set_packing set_covering mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
R. Meirich 8100 285 2.64016e-02 easy nseq 52200 n2seq36f.mps.gz

Static line planning models on the Dutch IC network

Imported from the MIPLIB2010 submissions.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 8100 8100
Constraints 285 285
Binaries 8100 8100
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.0264016 0.0264016
Nonzeroes 60948 60948
Constraint Classification Properties
Original Presolved
Total 285 285
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 225 225
Set Covering 2 2
Cardinality 0 0
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 58 58
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 2.354108
Constraint % 0.350877 0.350877 0.350877 0.350877
Variable % 0.444444 0.444444 0.444444 0.444444
Score 0.785965

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
1 52200 52200 0 0 0 - 2018-10-13 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to n2seq36f 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
neos-1516309 easy 4500 4500 0 0 489 30400 NEOS Server Submission neos-pseudoapplication-26 35954 binary decomposition set_packing set_covering knapsack
neos-1599274 easy 4500 4500 0 0 1237 46800 NEOS Server Submission neos-pseudoapplication-26 32075.6 binary decomposition set_packing set_covering knapsack
n3div36 easy 22120 22120 0 0 4484 340740 R. Meirich nseq 130800 benchmark binary decomposition benchmark_suitable set_packing set_covering mixed_binary
sp97ar easy 14101 14101 0 0 1761 290968 J. Goessens, S. v. Hoessel, L. Kroon sp9 660705645.759 benchmark binary benchmark_suitable variable_bound set_packing set_covering mixed_binary
sp98ic easy 10894 10894 0 0 825 316317 J. Goessens, S. v. Hoessel, L. Kroon sp9 449144758.4 binary decomposition benchmark_suitable variable_bound set_packing set_covering mixed_binary

Reference

No bibliographic information available

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