ex9

benchmark binary benchmark_suitable precedence set_partitioning invariant_knapsack

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Iulian Ober	10404	40962	1.2134e-03	easy	–	81	ex9.mps.gz

Formulations of Boolean SAT instance 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	10404	8560
Constraints	40962	33846
Binaries	0	8560
Integers	10404	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.00121340	0.00139133
Nonzeroes	517112	403100

Constraint Classification Properties
	Original	Presolved
Total	41124	33846
Empty	0	0
Free	0	0
Singleton	1120	0
Aggregations	0	0
Precedence	1152	1720
Variable Bound	0	0
Set Partitioning	0	162
Set Packing	0	0
Set Covering	0	0
Cardinality	0	0
Invariant Knapsack	0	31964
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	162	0
Mixed Binary	0	0
General Linear	38690	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.785330
Constraint %		0.0059100	0.0846974	0.0295456	0.768185
Variable %		0.0233645	0.3021810	0.1285050	2.476640
Score	0.050004

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

Similar instances in collection

The following instances are most similar to ex9 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	Constraints	Nonz.	Submitter	Group	Objective	Tags
ex10	easy	17680	0	17680	69608	1162000	Iulian Ober	–	100	benchmark binary benchmark_suitable precedence set_partitioning invariant_knapsack
supportcase10	hard	14770	14770	0	165684	555082	Michael Winkler	–	7	benchmark binary benchmark_suitable aggregations precedence variable_bound set_covering invariant_knapsack
tw-myciel4	hard	760	759	1	8146	27961	Arie Koster	–	10	aggregations precedence variable_bound invariant_knapsack general_linear
supportcase22	hard	7129	7129	0	260602	2228828	Michael Winkler	–	111.0	benchmark binary benchmark_suitable aggregations set_covering invariant_knapsack binpacking knapsack
graph20-80-1rand	hard	16263	16263	0	55107	191997	Michael Bastubbe	graphs	-6	binary decomposition precedence set_partitioning invariant_knapsack

Reference

No bibliographic information available