beasleyC3

benchmark decomposition benchmark_suitable aggregations variable_bound mixed_binary

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
F. Ortega, L. Wolsey	2500	1750	1.14286e-03	easy	beasley	753.9999999999128	beasleyC3.mps.gz

Fixed cost network flow problems 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	2500	2471
Constraints	1750	1722
Binaries	1250	1223
Integers	0	0
Continuous	1250	1248
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.00114286	0.00116144
Nonzeroes	5000	4942

Constraint Classification Properties
	Original	Presolved
Total	1750	1722
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	160	159
Precedence	0	0
Variable Bound	1250	1223
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	340	340
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.542825
Constraint %		0.0584795	0.277106	0.175439	15.2047
Variable %		0.0800641	0.282870	0.160128	15.6926
Score	0.929762

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	754	754	0	0	0	-	2018-10-12	Solution found during MIPLIB2017 problem selection.
1	754	754	0	0	0	-	2018-10-12	Solution imported from MIPLIB2010.

Similar instances in collection

The following instances are most similar to beasleyC3 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
mc7	easy	3040	1520	1520	1920	6080	F. Ortega, L. Wolsey	mc	3417	decomposition benchmark_suitable variable_bound mixed_binary
mc8	easy	3040	1520	1520	1920	6080	F. Ortega, L. Wolsey	mc	1566	decomposition benchmark_suitable variable_bound mixed_binary
mc11	easy	3040	1520	1520	1920	6080	F. Ortega, L. Wolsey	mc	11688.99999999966	benchmark decomposition benchmark_suitable variable_bound mixed_binary
beasleyC2	easy	2500	1250	1250	1750	5000	F. Ortega, L. Wolsey	beasley	144	decomposition benchmark_suitable aggregations variable_bound mixed_binary
p500x2988d	easy	5976	2988	2988	3488	11952	MIPLIB submission pool	pr_product	6	decomposition variable_bound mixed_binary

Reference

@article{OrtegaWolsey2003,
 author = {F. Ortega and L.A. Wolsey},
 journal = {Networks},
 language = {English},
 number = {3},
 pages = {143--158},
 title = {A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem},
 volume = {41},
 year = {2003}
}