n3div36

benchmark binary decomposition benchmark_suitable set_packing set_covering mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
R. Meirich 22120 4484 3.43536e-03 easy nseq 130800 n3div36.mps.gz

Static line planning models on the Dutch IC network. Solved with Gurobi 4.5.1 on a 12-core Linux system in 1700.37 sec.

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 22120 22120
Constraints 4484 4484
Binaries 22120 22120
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00343536 0.00343536
Nonzeroes 340740 340740
Constraint Classification Properties
Original Presolved
Total 4484 4484
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 4424 4424
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 3.645913
Constraint % 0.0223015 0.0223015 0.0223015 0.0223015
Variable % 0.0226040 0.0226040 0.0226040 0.0226040
Score 0.986396

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

Similar instances in collection

The following instances are most similar to n3div36 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-1599274 easy 4500 4500 0 0 1237 46800 NEOS Server Submission neos-pseudoapplication-26 32075.6 binary decomposition set_packing set_covering knapsack
neos-1516309 easy 4500 4500 0 0 489 30400 NEOS Server Submission neos-pseudoapplication-26 35954 binary decomposition set_packing set_covering knapsack
n2seq36f easy 8100 8100 0 0 285 60948 R. Meirich nseq 52200 binary decomposition benchmark_suitable set_packing set_covering mixed_binary
sp97ic easy 12497 12497 0 0 1033 316629 J. Goessens, S. v. Hoessel, L. Kroon sp9 427684487.68 binary decomposition 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

@mastersthesis{Meirich2010,
 author = {Robert Meirich},
 school = {Technische {Universit\"at} Berlin},
 title = {Polyedrische {U}ntersuchung eines {L}inienplanungsproblems},
 type = {Diploma thesis},
 year = {2010}
}

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