satellites3-25

benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack knapsack mixed_binary

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
He Renjie	81681	44804	1.90777e-04	easy	satellites	-25	satellites3-25.mps.gz

Ihe attachment is some instances generated from real life satelliteschedule problem data,these instances are easier comparable to real lifeproblem. The work is done by me and Alberto Ceselli from Univeristy ofMilano. I donnot know it is hard enough or not, if needs , I can generatemore difficult instances. Imported from the MIPLIB2010 submissions. 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	81681	81640
Constraints	44804	44804
Binaries	79961	79960
Integers	0	0
Continuous	1720	1680
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.000190777	0.000190862
Nonzeroes	698176	698134

Constraint Classification Properties
	Original	Presolved
Total	44804	44804
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	1189	1189
Precedence	29	29
Variable Bound	1	1
Set Partitioning	25985	26070
Set Packing	110	110
Set Covering	0	0
Cardinality	3479	3394
Invariant Knapsack	9251	9251
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	29
Integer Knapsack	0	0
Mixed Binary	4760	4731
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	2.932474
Constraint %		0.0647264	0.0680547	0.0647264	2.91045
Variable %		0.0722685	0.1124180	0.1077900	5.44953
Score	0.579695

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

Similar instances in collection

The following instances are most similar to satellites3-25 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
satellites4-25	easy	95637	93747	0	1890	51712	821192	He Renjie	satellites	-25	benchmark_suitable aggregations precedence set_partitioning set_packing cardinality invariant_knapsack knapsack mixed_binary
satellites2-40	easy	35378	34324	0	1054	20916	283668	He Renjie	satellites	-19	benchmark benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack knapsack mixed_binary
satellites2-25	easy	35378	34324	0	1054	20916	283668	He Renjie	satellites	-19	benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack knapsack mixed_binary
satellites2-60-fs	easy	35378	34324	0	1054	16516	125048	He Renjie	satellites	-19.0000000001	benchmark benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing cardinality knapsack mixed_binary
piperout-d20	easy	11961	11788	149	24	15562	190915	Gleb Belov	piperout	29948	decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack binpacking knapsack integer_knapsack mixed_binary general_linear

Reference

No bibliographic information available