decomp1

binary decomposition precedence set_partitioning set_packing invariant_knapsack binpacking mixed_binary

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Martin Berger	10735	8357	5.33806e-04	easy	–	-120	decomp1.mps.gz

Finds special structures in MIPs. Imported from the MIPLIB2010 submissions.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	10735	10729
Constraints	8357	8335
Binaries	10735	10729
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	6	0
Nonzero Density	0.000533806	0.000535380
Nonzeroes	47889	47877

Constraint Classification Properties
	Original	Presolved
Total	8357	8335
Empty	22	0
Free	0	0
Singleton	0	0
Aggregations	0	0
Precedence	2688	2688
Variable Bound	0	0
Set Partitioning	470	470
Set Packing	221	221
Set Covering	0	0
Cardinality	0	0
Invariant Knapsack	2477	2698
Equation Knapsack	0	0
Bin Packing	0	2256
Knapsack	0	0
Integer Knapsack	0	0
Mixed Binary	2479	2
General Linear	0	0
Indicator	0	0

Structure

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

Nonzero entries of original problem

Nonzero entries after trivial presolving

Decomposed structure of original problem (dec-file)

Decomposed structure after trivial presolving (dec-file)

	value	min	median	mean	max
Components	2.418301
Constraint %		0.011999	0.362132	0.011999	10.64310
Variable %		0.111784	0.382713	0.111784	9.79041
Score	0.923138

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

Similar instances in collection

The following instances are most similar to decomp1 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
decomp2	easy	14387	14387	0	0	10765	64073	Martin Berger	–	-160	benchmark binary decomposition benchmark_suitable 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