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

J. Aronson | 504 | 447 | 4.56172e-02 | easy | ran | 3712 | ran14x18-disj-8.mps.gz |

Fixed charge transportation problem

Imported from MIPLIB2010.

Detailed explanation of the following tables can be found here.

Original | Presolved | |
---|---|---|

Variables | 504 | 504 |

Constraints | 447 | 447 |

Binaries | 252 | 252 |

Integers | 0 | 0 |

Continuous | 252 | 252 |

Implicit Integers | 0 | 0 |

Fixed Variables | 0 | 0 |

Nonzero Density | 0.0456172 | 0.0456172 |

Nonzeroes | 10277 | 10277 |

Original | Presolved | |
---|---|---|

Total | 447 | 447 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 0 | 0 |

Aggregations | 0 | 0 |

Precedence | 0 | 0 |

Variable Bound | 252 | 252 |

Set Partitioning | 0 | 0 |

Set Packing | 0 | 0 |

Set Covering | 49 | 49 |

Cardinality | 0 | 0 |

Invariant Knapsack | 0 | 0 |

Equation Knapsack | 0 | 0 |

Bin Packing | 0 | 0 |

Knapsack | 0 | 0 |

Integer Knapsack | 0 | 0 |

Mixed Binary | 146 | 146 |

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.403121 | ||||

Constraint % | 0.223714 | 0.223714 | 0.223714 | 0.223714 | |

Variable % | 0.396825 | 0.396825 | 0.396825 | 0.396825 | |

Score | 0.561521 |

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 | 3712 | 6e-07 | 7e-07 | 0 | - | 2018-10-10 | Solution found during MIPLIB2017 problem selection. | |

2 | 3712 | 0e+00 | 1e-07 | 0 | - | 2018-10-10 | Solution imported from MIPLIB2010. |

The following instances are most similar to ran14x18-disj-8 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 |
---|---|---|---|---|---|---|---|---|---|---|---|

g503inf | easy | 48 | 24 | 0 | 24 | 41 | 144 | MIPLIB submission pool | -- | Infeasible | infeasible variable_bound binpacking knapsack mixed_binary |

ran12x21 | easy | 504 | 252 | 0 | 252 | 285 | 1008 | J. Aronson | ran | 3664 | decomposition benchmark_suitable variable_bound mixed_binary |

gr4x6 | easy | 48 | 24 | 0 | 24 | 34 | 96 | MIPLIB submission pool | -- | 202.349999999998 | variable_bound mixed_binary |

neos-480878 | easy | 534 | 189 | 0 | 345 | 1321 | 44370 | NEOS Server Submission | neos-pseudoapplication-76 | 492.5144492879 | benchmark_suitable variable_bound set_partitioning set_packing invariant_knapsack mixed_binary |

ran13x13 | easy | 338 | 169 | 0 | 169 | 195 | 676 | J. Aronson | ran | 3252 | decomposition benchmark_suitable variable_bound mixed_binary |

```
@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 Mai 20, 2021 by Philipp Wellner

generated with R Markdown

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

Imprint