n2seq36q

benchmark binary benchmark_suitable set_packing set_covering invariant_knapsack binpacking knapsack

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
R. Meirich	22480	2565	3.17878e-03	easy	nseq	52200	n2seq36q.mps.gz

Static line planning models on the Dutch IC network 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	22480	22480
Constraints	2565	2565
Binaries	22480	22480
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.00317878	0.00317878
Nonzeroes	183292	183292

Constraint Classification Properties
	Original	Presolved
Total	2565	2565
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	0	0
Precedence	0	0
Variable Bound	0	0
Set Partitioning	0	0
Set Packing	285	285
Set Covering	1832	120
Cardinality	0	0
Invariant Knapsack	0	1712
Equation Knapsack	0	0
Bin Packing	0	2
Knapsack	0	446
Integer Knapsack	0	0
Mixed Binary	448	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.579784
Constraint %		0.0779727	1.80602	2.18324	2.33918
Variable %		0.0889680	1.05295	1.24110	1.26779
Score	0.660243

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

Similar instances in collection

The following instances are most similar to n2seq36q 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-941313	easy	167910	167910	13189	484080	NEOS Server Submission	neos-pseudoapplication-81	9360.999999999985	binary decomposition benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack knapsack
bab5	easy	21600	21600	4964	155520	Elmar Swarat	bab	-106411.8401	binary decomposition benchmark_suitable aggregations set_partitioning set_packing set_covering cardinality invariant_knapsack equation_knapsack knapsack mixed_binary
neos-3555904-turama	easy	37461	37461	146493	793605	Hans Mittelmann	neos-pseudoapplication-81	-34.7	benchmark binary benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack
bab3	open	393800	393800	23069	3301838	Elmar Swarat	bab	-656214.9542*	binary decomposition aggregations set_partitioning set_packing set_covering cardinality invariant_knapsack equation_knapsack knapsack mixed_binary
neos-859770	easy	2504	2504	2065	880736	NEOS Server Submission	neos-pseudoapplication-81	Infeasible	infeasible binary benchmark_suitable set_partitioning invariant_knapsack mixed_binary

Reference

No bibliographic information available