n3705

decomposition variable_bound mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
J. Aronson 10000 5150 3.8835e-04 open n37 1212657.0* n3705.mps.gz

Fixed charge transportation problem Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 10000 10000
Constraints 5150 5150
Binaries 5000 5000
Integers 0 0
Continuous 5000 5000
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00038835 0.00038835
Nonzeroes 20000 20000
Constraint Classification Properties
Original Presolved
Total 5150 5150
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 0 0
Variable Bound 5000 5000
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 150 150
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 2.004321
Constraint % 0.990291 0.990291 0.990291 0.990291
Variable % 1.000000 1.000000 1.000000 1.000000
Score 0.980388

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
6 1212657 1212657 0e+00 0 0 Edward Rothberg 2020-09-14 Found with Gurobi
5 1225465 1225465 0e+00 0 0 Edward Rothberg 2020-06-11 Obtained with Gurobi 9.0 using the solution improvement heuristic
4 1229683 1229683 0e+00 0 0 Edward Rothberg 2020-04-22 Obtained with Gurobi 9.0 using the solution improvement heuristic
3 1239667 8e-07 0 0 Edward Rothberg 2019-12-13 Obtained with Gurobi 9.0
2 1247398 0e+00 0 0 Robert Ashford and Alkis Vazacopoulus 2019-12-18 Found using ODH|CPlex
1 1264759 1264759 0e+00 0 0 - 2018-10-12 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to n3705 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
n3709 open 10000 5000 0 5000 5150 20000 J. Aronson n37 1207965.0* decomposition variable_bound mixed_binary
n370b open 10000 5000 0 5000 5150 20000 J. Aronson n37 1225077.0* decomposition variable_bound mixed_binary
n3700 open 10000 5000 0 5000 5150 20000 J. Aronson n37 1218974.9999999998* decomposition variable_bound mixed_binary
h50x2450 easy 4900 2450 0 2450 2549 12152 MIPLIB submission pool fixed-cost-network-flow 32906.880834 decomposition benchmark_suitable variable_bound set_partitioning mixed_binary
n3707 open 10000 5000 0 5000 5150 20000 J. Aronson n37 1186691.0* decomposition variable_bound mixed_binary

Reference

@article{SunAronsonMcKeownDrinka1998,
 author = {Sun, M. and Aronson, J. E. and McKeown, P. G. and Drinka, D. A.},
 journal = {European Journal of Operational Research},
 language = {English},
 pages = {441-456},
 title = {A tabu search heuristic procedure for the fixed charge
transportation problem},
 volume = {106},
 year = {1998}
}

Last Update Mar 04, 2024 by Julian Manns
generated with R Markdown
© 2023 by Zuse Institute Berlin (ZIB)
Imprint