rout

decomposition benchmark_suitable variable_bound set_packing integer_knapsack general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
MIPLIB submission pool	556	291	1.50251e-02	easy	–	1077.559999999999	rout.mps.gz

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	556	556
Constraints	291	291
Binaries	300	300
Integers	15	15
Continuous	241	241
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.0150251	0.0150251
Nonzeroes	2431	2431

Constraint Classification Properties
	Original	Presolved
Total	291	291
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	0	0
Precedence	0	0
Variable Bound	240	240
Set Partitioning	0	0
Set Packing	14	14
Set Covering	0	0
Cardinality	0	0
Invariant Knapsack	0	0
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	1	6
Mixed Binary	0	0
General Linear	36	31
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.491362
Constraint %		0.343643	2.92096	2.92096	5.49828
Variable %		0.359712	3.32734	3.32734	6.29496
Score	0.824186

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

Similar instances in collection

The following instances are most similar to rout 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	Continuous	Constraints	Nonz.	Submitter	Group	Objective	Tags
danoint	easy	521	56	465	664	3232	Daniel Bienstock	dano	65.6666666666	benchmark_suitable variable_bound cardinality mixed_binary
newdano	easy	505	56	449	576	2184	Daniel Bienstock	dano	65.66666666	decomposition benchmark_suitable precedence variable_bound cardinality mixed_binary
bienst2	easy	505	35	470	576	2184	H. Mittelmann	–	54.59999999999996	decomposition benchmark_suitable precedence variable_bound cardinality mixed_binary
bienst1	easy	505	28	477	576	2184	MIPLIB submission pool	–	46.7499999999999	decomposition benchmark_suitable precedence variable_bound cardinality mixed_binary
aflow30a	easy	842	421	421	479	2091	T. Achterberg	aflow	1158	decomposition benchmark_suitable variable_bound set_partitioning mixed_binary

Reference

No bibliographic information available