neos-3682128-sandon

aggregations variable_bound set_packing cardinality invariant_knapsack equation_knapsack knapsack integer_knapsack general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Hans Mittelmann	7880	14920	4.29005e-04	open	neos-pseudoapplication-10	34666770*	neos-3682128-sandon.mps.gz

Collection of anonymous submissions to the NEOS Server for Optimization

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	7880	7760
Constraints	14920	14920
Binaries	7870	7750
Integers	10	10
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.000429005	0.000435640
Nonzeroes	50438	50438

Constraint Classification Properties
	Original	Presolved
Total	14920	14920
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	5	5
Precedence	0	0
Variable Bound	7205	7205
Set Partitioning	0	0
Set Packing	480	480
Set Covering	7153	0
Cardinality	2	2
Invariant Knapsack	0	7158
Equation Knapsack	60	60
Bin Packing	0	0
Knapsack	0	5
Integer Knapsack	1	1
Mixed Binary	10	0
General Linear	4	4
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	0.7781512
Constraint %		9.75871	9.75871	9.75871	9.75871
Variable %		18.76290	18.76290	18.76290	18.76290
Score	0.3963850

Best Known Solution(s)

Find solutions below. Download the archive containing all solutions from the Download page.

## Warning in lapply(df["exactobjval"], as.numeric): NAs introduced by coercion

ID	Objective	Exact	Int. Viol	Cons. Viol	Obj. Viol	Submitter	Date	Description
2	34666770		0	0	0	Robert Ashford and Alkis Vazacopoulus	2019-12-18	Found using ODH\|CPlex
1	34674770	34674770	0	0	0	-	2018-10-15	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to neos-3682128-sandon 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
umts	easy	2947	2802	72	73	4465	22872	C. Polo	–	30090327.99999997	decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning set_covering cardinality invariant_knapsack knapsack mixed_binary general_linear
lr2-22dr3-333vc4v17a-t60	open	109519	92865	0	16654	108566	435517	Dimitri Papageorgiou	maritime	-27262.58917622233*	decomposition aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack mixed_binary
neos-633273	easy	11154	11154	0	0	21781	63910	NEOS Server Submission	neos-pseudoapplication-10	6996841097.99778	binary aggregations set_partitioning cardinality invariant_knapsack
neos-3581454-haast	easy	8112	7512	0	600	17220	92976	Jeff Linderoth	neos-pseudoapplication-14	2295	decomposition benchmark_suitable precedence variable_bound set_partitioning set_packing invariant_knapsack knapsack mixed_binary
neos-5261882-treska	hard	2900	2730	0	170	2971	19342	Hans Mittelmann	neos-pseudoapplication-102	51614.874	decomposition precedence set_partitioning cardinality binpacking knapsack mixed_binary

Reference

No bibliographic information available