ci-s4

decomposition benchmark_suitable aggregations precedence variable_bound mixed_binary general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Alexandra M. Newman	745	26159	6.62567e-03	easy	–	3336.23984845	ci-s4.mps.gz

minimizing violence in a counterinsurgency model (lot os regressions built in)

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	745	745
Constraints	26159	26159
Binaries	355	355
Integers	150	150
Continuous	240	240
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.00662567	0.00662567
Nonzeroes	129124	129124

Constraint Classification Properties
	Original	Presolved
Total	26159	26159
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	115	115
Precedence	93	93
Variable Bound	390	390
Set Partitioning	0	0
Set Packing	0	0
Set Covering	0	0
Cardinality	0	0
Invariant Knapsack	0	0
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	0	0
Mixed Binary	1651	1651
General Linear	23910	23910
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.612784
Constraint %		0.003820	2.34215	0.003820	6.22204
Variable %		0.268456	2.10738	0.268456	9.39597
Score	0.894018

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

Similar instances in collection

The following instances are most similar to ci-s4 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
nag	open	2884	1350	35	1499	5840	26499	N. Shenoy	–	945*	aggregations precedence variable_bound set_partitioning mixed_binary general_linear
neos-3355120-tarago	open	7800	4700	3100	0	86633	265500	Hans Mittelmann	neos-pseudoapplication-52	-11115971.493905*	decomposition numerics aggregations precedence variable_bound set_partitioning set_packing cardinality binpacking integer_knapsack mixed_binary general_linear
lectsched-5-obj	easy	21805	21389	416	0	38884	239608	Harald Schilly	lectsched	24	benchmark benchmark_suitable aggregations precedence variable_bound set_covering invariant_knapsack integer_knapsack general_linear
neos-3709489-menik	easy	48005	31506	15424	1075	59587	199272	Jeff Linderoth	neos-pseudoapplication-44	Unbounded	aggregations precedence variable_bound set_packing set_covering cardinality invariant_knapsack binpacking mixed_binary general_linear
neos-3699044-maipo	easy	48007	31506	15424	1077	59589	199334	Jeff Linderoth	neos-pseudoapplication-63	Unbounded	aggregations precedence variable_bound set_packing set_covering cardinality binpacking mixed_binary general_linear

Reference

We have a working paper, to be submitted in a  few months.