supportcase3

binary feasibility aggregations precedence variable_bound invariant_knapsack knapsack mixed_binary

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Michael Winkler	4191	12702	1.00443e-03	easy	–	0	supportcase3.mps.gz

MIP instances collected from Gurobi forum with unknown application Solved with ParaSCIP in 1551 seconds with 71 solvers(72 cores). Solved with COPT 7.0 using up to 12 threads in less than 30 minutes

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	4191	3167
Constraints	12702	9630
Binaries	4191	3167
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.00100443	0.00145104
Nonzeroes	53470	44254

Constraint Classification Properties
	Original	Presolved
Total	12702	9630
Empty	0	0
Free	0	0
Singleton	1024	0
Aggregations	3	3
Precedence	0	1028
Variable Bound	0	1020
Set Partitioning	0	0
Set Packing	0	0
Set Covering	8192	0
Cardinality	0	0
Invariant Knapsack	0	4096
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	3096
Integer Knapsack	0	0
Mixed Binary	3483	387
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.963788
Constraint %		0.166147	0.701448	0.664590	1.00727
Variable %		0.244765	0.946185	0.897471	1.35980
Score	0.631767

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	0	0	0	0	0	Yuji Shinano	2018-11-09	Reported by ParaSCIP using 72 cores

Similar instances in collection

The following instances are most similar to supportcase3 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
supportcase4	easy	3162	3162	0	9492	38036	Michael Winkler	–	0	binary feasibility benchmark_suitable aggregations precedence variable_bound invariant_knapsack knapsack mixed_binary
bnatt400	easy	3600	3600	0	5614	21698	Tatsuya Akutsu	bnatt	1	benchmark binary benchmark_suitable precedence set_covering invariant_knapsack binpacking knapsack
bnatt500	easy	4500	4500	0	7029	27203	Tatsuya Akutsu	bnatt	Infeasible	benchmark infeasible binary benchmark_suitable precedence set_covering invariant_knapsack binpacking knapsack
cryptanalysiskb128n5obj14	hard	48950	47830	1120	98021	292875	Gleb Belov	cryptanalysis	Infeasible	benchmark infeasible feasibility benchmark_suitable aggregations precedence variable_bound set_covering cardinality invariant_knapsack binpacking knapsack integer_knapsack mixed_binary general_linear
cryptanalysiskb128n5obj16	easy	48950	47830	1120	98021	292875	Gleb Belov	cryptanalysis	0	benchmark feasibility benchmark_suitable aggregations precedence variable_bound set_covering cardinality invariant_knapsack binpacking knapsack integer_knapsack mixed_binary general_linear

Reference

No bibliographic information available