datt256

no_solution binary set_partitioning cardinality

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Jon Dattorro	262144	11077	5.17855e-04	open	–	NA	datt256.mps.gz

Model to find solution to the ``Eternity II’’ puzzle 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	262144	196147
Constraints	11077	9865
Binaries	262144	196147
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.000517855	0.000581615
Nonzeroes	1503730	1125420

Constraint Classification Properties
	Original	Presolved
Total	11077	9865
Empty	0	0
Free	0	0
Singleton	4	0
Aggregations	0	0
Precedence	0	0
Variable Bound	0	0
Set Partitioning	512	750
Set Packing	0	0
Set Covering	0	0
Cardinality	10560	9115
Invariant Knapsack	0	0
Equation Knapsack	1	0
Bin Packing	0	0
Knapsack	0	0
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	0.301030
Constraint %		92.3974	92.3974	92.3974	92.3974
Variable %		99.9954	99.9954	99.9954	99.9954
Score	0.000042

Best Known Solution(s)

No solution available for datt256 .

Similar instances in collection

The following instances are most similar to datt256 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
tbfp-network	easy	72747	72747	0	0	2436	215837	Rob Pratt	–	24.16319444	benchmark binary benchmark_suitable set_partitioning cardinality
s100	hard	364417	364417	0	0	14733	1777917	Daniel Espinoza	Spinoza	-0.1697235270583	benchmark binary benchmark_suitable aggregations set_partitioning set_packing cardinality invariant_knapsack knapsack
neos-826224	easy	41820	27540	0	14280	17266	127840	NEOS Server Submission	neos-pseudoapplication-87	121	decomposition set_partitioning set_packing cardinality binpacking mixed_binary
neos-4531126-vouga	open	169996	169996	0	0	7694	967980	Jeff Linderoth	neos-pseudoapplication-87	525030.8846192999*	binary decomposition numerics set_partitioning cardinality invariant_knapsack binpacking mixed_binary
supportcase6	easy	130052	130051	1	0	771	584976	Michael Winkler	–	51906.47737	benchmark benchmark_suitable set_partitioning cardinality general_linear

Reference

@book{Dattorro2011,
 author = {Jon Dattorro},
 publisher = {Meboo Publishing USA},
 title = {Convex Optimization \& Euclidean Distance Geometry},
 year = {2011}
}

@misc{dattorroeternity,
 key = {zzz dattorro},
 note = {http://www.convexoptimization.com/wikimization/index.php/Dattorro_Convex_Optimization_of_Eternity_II},
 title = {Convex Optimization of Eternity II},
 year = {2011}
}

@misc{eternityii,
 key = {zzz eternityii},
 note = {http://www.eternityii.com},
 title = {{Eternity II} puzzle},
 year = {2007}
}