d20200

binary decomposition set_partitioning invariant_knapsack knapsack

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
COR@L test set	4000	1502	3.15228e-02	open	–	12239.0*	d20200.mps.gz

Instance coming from the COR@L test set with unknown origin Imported from MIPLIB2010.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	4000	3181
Constraints	1502	1502
Binaries	4000	3181
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	819	0
Nonzero Density	0.0315228	0.0355211
Nonzeroes	189389	169715

Constraint Classification Properties
	Original	Presolved
Total	1502	1502
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	0	0
Precedence	0	0
Variable Bound	0	0
Set Partitioning	200	200
Set Packing	0	0
Set Covering	0	0
Cardinality	0	0
Invariant Knapsack	123	123
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	1179	1179
Integer Knapsack	0	0
Mixed Binary	0	0
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	1.322219
Constraint %		2.13049	4.33422	4.56059	5.12650
Variable %		4.49544	5.00000	4.98271	5.28136
Score	0.823449

Best Known Solution(s)

Find solutions below. Download the archive containing all solutions from the Download page.

## Warning in lapply(df["exactobjval"], as.numeric): NAs introduced by coercion

ID	Objective	Exact	Submitter	Date	Description
3	12239	12239	Ed Klotz	2024-01-11	It was obtained by letting the recently released Gurobi 11.0 run for about two days with CoverCuts=2 and RINS=200 for the Rins heuristic frequency.
2	12240		Edward Rothberg	2019-12-13	Obtained with Gurobi 9.0
1	12252	12252	-	2018-10-10	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to d20200 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	Constraints	Nonz.	Submitter	Group	Objective	Tags
neos-4954274-beardy	hard	12865	12865	17359	140082	Jeff Linderoth	neos-pseudoapplication-62	20946.48	binary decomposition variable_bound set_partitioning set_packing set_covering cardinality invariant_knapsack binpacking knapsack
circ10-3	open	2700	2700	42620	307320	M. Winkler	–	280*	binary decomposition precedence variable_bound set_partitioning set_packing invariant_knapsack knapsack mixed_binary
p2m2p1m1p0n100	easy	100	100	1	100	B. Krishnamoorthy, G. Pataki	–	Infeasible	infeasible binary benchmark_suitable knapsack mixed_binary
neos-876808	easy	87268	87268	85808	682376	NEOS Server Submission	neos-pseudoapplication-62	169795.259907	binary decomposition benchmark_suitable aggregations set_packing set_covering invariant_knapsack knapsack mixed_binary
s1234	hard	2945	2945	8418	44641	Siwei Sun	SiweiSun	29	binary precedence set_covering invariant_knapsack binpacking knapsack

Reference

@misc{coral,
 key = {zzz coral},
 note = {http://coral.ie.lehigh.edu/data-sets/mixed-integer-instances/},
 title = {{COR@L} {MIP} {I}nstances},
 year = {2010}
}