mc11

benchmark decomposition benchmark_suitable variable_bound mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
F. Ortega, L. Wolsey 3040 1920 1.04167e-03 easy mc 11688.99999999966 mc11.mps.gz

Fixed cost network flow problems Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 3040 3040
Constraints 1920 1920
Binaries 1520 1520
Integers 0 0
Continuous 1520 1520
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00104167 0.00104167
Nonzeroes 6080 6080
Constraint Classification Properties
Original Presolved
Total 1920 1920
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 0 0
Variable Bound 1520 1520
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 400 400
General Linear 0 0
Indicator 0 0

Structure

Available nonzero structure and decomposition information. Further information can be found here.

value min median mean max
Components 3.089552
Constraint % 0.0520833 0.0675217 0.0520833 4.79167
Variable % 0.0657895 0.0814332 0.0657895 4.86842
Score 0.819416

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

Similar instances in collection

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

Last Update 2024 by Mark Turner
generated with R Markdown
© by Zuse Institute Berlin (ZIB)
Imprint