Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
---|---|---|---|---|---|---|---|

J. Aronson | 10000 | 5150 | 3.8835e-04 | open | n37 | 1245141* | n3700.mps.gz |

Fixed charge transportation problem

Imported from MIPLIB2010.

Detailed explanation of the following tables can be found here.

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 |

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 |

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

Decomposed structure of original problem (dec-file)

Decomposed structure after trivial presolving (dec-file)

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 |

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

The following instances are most similar to n3700 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 | Variables | Binaries | Integers | Continuous | Constraints | Nonz. | Submitter | Group | Status | Objective |
---|---|---|---|---|---|---|---|---|---|---|

n370b | 10000 | 5000 | 0 | 5000 | 5150 | 20000 | J. Aronson | n37 | open | 1256398* |

n3707 | 10000 | 5000 | 0 | 5000 | 5150 | 20000 | J. Aronson | n37 | open | 1217798* |

h50x2450 | 4900 | 2450 | 0 | 2450 | 2549 | 12152 | MIPLIB submission pool | fixed-cost-network-flow | easy | 32906.880834 |

n3705 | 10000 | 5000 | 0 | 5000 | 5150 | 20000 | J. Aronson | n37 | open | 1264759* |

n3709 | 10000 | 5000 | 0 | 5000 | 5150 | 20000 | J. Aronson | n37 | open | 1246679* |

```
@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 Jan 18, 2019 by Gregor Hendel

generated with R Markdown

© 2018 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)

Imprint