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

Simon Bowly | 30 | 27 | 6.5679e-01 | easy | generated | 6840.96564179 | gen-ip054.mps.gz |

Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms.

Detailed explanation of the following tables can be found here.

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

Variables | 30 | 30 |

Constraints | 27 | 27 |

Binaries | 0 | 0 |

Integers | 30 | 30 |

Continuous | 0 | 0 |

Implicit Integers | 0 | 0 |

Fixed Variables | 0 | 0 |

Nonzero Density | 0.65679 | 0.65679 |

Nonzeroes | 532 | 532 |

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

Total | 27 | 27 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 0 | 0 |

Aggregations | 0 | 0 |

Precedence | 0 | 0 |

Variable Bound | 1 | 1 |

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 | 0 | 0 |

General Linear | 26 | 26 |

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 | 0.4771212 | ||||

Constraint % | 3.70370 | 5.55556 | 5.55556 | 7.40741 | |

Variable % | 6.66667 | 31.66670 | 31.66670 | 56.66670 | |

Score | 0.0666670 |

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

The following instances are most similar to gen-ip054 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 |
---|---|---|---|---|---|---|---|---|---|---|---|

gen-ip021 | easy | 35 | 0 | 35 | 0 | 28 | 945 | Simon Bowly | generated | 2361.45419519 | benchmark_suitable general_linear |

tokyometro | open | 4537 | 2496 | 2041 | 0 | 7719 | 26958 | Hsiang-Yun WU | – | 8329.4* | aggregations precedence variable_bound set_partitioning equation_knapsack mixed_binary general_linear |

timtab1CUTS | easy | 397 | 77 | 94 | 226 | 371 | 1742 | C. Liebchen, R. Möhring | timtab | 764772 | benchmark_suitable aggregations precedence variable_bound invariant_knapsack mixed_binary general_linear |

neos16 | easy | 377 | 336 | 41 | 0 | 1018 | 2801 | NEOS Server Submission | neos-pseudoapplication-90 | 446 | benchmark_suitable variable_bound integer_knapsack general_linear |

neos-3046615-murg | easy | 274 | 240 | 16 | 18 | 498 | 1266 | Jeff Linderoth | neos-pseudoapplication-90 | 1600 | benchmark benchmark_suitable aggregations variable_bound mixed_binary general_linear |

`No bibliographic information available`

Last Update Mär 25, 2020 by Gabriel Kressin

generated with R Markdown

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

Imprint