netdiversion

benchmark binary benchmark_suitable precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Chris Cullenbine	129180	119589	3.98279e-05	easy	–	242	netdiversion.mps.gz

Directed network diversion problem Imported from MIPLIB2010.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	129180	129174
Constraints	119589	119589
Binaries	129180	129174
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	3.98279e-05	3.98290e-05
Nonzeroes	615282	615270

Constraint Classification Properties
	Original	Presolved
Total	119589	119589
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	0	0
Precedence	103	103
Variable Bound	303	303
Set Partitioning	1	2
Set Packing	59597	59597
Set Covering	39586	0
Cardinality	19999	19998
Invariant Knapsack	0	39586
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	0	0
Mixed Binary	0	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	4.278685
Constraint %		0.000836	0.00183	0.00167	2.88825
Variable %		0.004640	0.00487	0.00464	4.27640
Score	0.345641

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
2	242	242	0	0	0	-	2018-10-29	Solution imported from MIPLIB2010.
1	242	242	0	0	0	-	2018-10-11	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to netdiversion 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
academictimetablesmall	easy	28926	28926	0	0	23294	268350	Joshua Friedman	–	0	benchmark binary decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack equation_knapsack binpacking knapsack
nursesched-medium-hint03	hard	34248	34170	78	0	14062	622800	Haroldo Gambini Santos	nursescheduling	115	benchmark decomposition benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear
chromaticindex1024-7	easy	73728	73728	0	0	67583	270324	Pierre Le Bodic	chromaticindex	4	benchmark binary benchmark_suitable set_partitioning set_packing
neos-933638	easy	32417	28637	0	3780	13658	187173	NEOS Server Submission	neos-pseudoapplication-34	275.9999999999998	benchmark_suitable precedence variable_bound set_packing invariant_knapsack mixed_binary
academictimetablebig	hard	168974	168974	0	0	167661	1545375	Joshua Friedman	–	427	binary aggregations precedence variable_bound set_partitioning set_packing set_covering cardinality invariant_knapsack equation_knapsack binpacking knapsack

Reference

@article{Curet2001,
 author = {N. D. Curet},
 journal = {Military Operations Research},
 language = {English},
 number = {2},
 pages = {35-44},
 title = {The network diversion problem},
 volume = {6},
 year = {2001}
}