decomp2

benchmark binary decomposition benchmark_suitable precedence set_partitioning set_packing invariant_knapsack binpacking mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
Martin Berger 14387 10765 4.13705e-04 easy -160 decomp2.mps.gz

Finds special structures in MIPs.

Imported from the MIPLIB2010 submissions.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 14387 14379
Constraints 10765 10735
Binaries 14387 14379
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 8 0
Nonzero Density 0.000413705 0.000414988
Nonzeroes 64073 64057
Constraint Classification Properties
Original Presolved
Total 10765 10735
Empty 30 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 3584 3584
Variable Bound 0 0
Set Partitioning 470 470
Set Packing 221 221
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 3229 3450
Equation Knapsack 0 0
Bin Packing 0 3008
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 3231 2
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.418301
Constraint % 0.009320 0.361404 0.009320 10.64840
Variable % 0.111212 0.382716 0.111212 9.80747
Score 0.921177

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 -160 -160 0 0 0 - 2018-10-12 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to decomp2 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
decomp1 easy 10735 10735 0 0 8357 47889 Martin Berger -120 binary decomposition precedence set_partitioning set_packing invariant_knapsack binpacking mixed_binary
neos-738098 easy 9093 8946 0 147 25849 101360 NEOS Server Submission neos-pseudoapplication-15 -1099 benchmark_suitable precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack equation_knapsack binpacking mixed_binary general_linear
neos-555424 easy 3815 3800 15 0 2676 15667 NEOS Server Submission neos-pseudoapplication-15 1286800 decomposition benchmark_suitable precedence invariant_knapsack equation_knapsack binpacking mixed_binary general_linear
neos-555343 easy 3815 3800 15 0 3326 16967 NEOS Server Submission neos-pseudoapplication-15 1512800 decomposition benchmark_suitable aggregations precedence invariant_knapsack equation_knapsack binpacking mixed_binary general_linear
neos-1337307 easy 2840 2840 0 0 5687 30799 NEOS Server Submission neos-pseudoapplication-13 -202319 binary decomposition benchmark_suitable precedence set_partitioning invariant_knapsack knapsack 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