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

Shunji Umetani | 1000000 | 5000 | 2.5e-03 | open | scp | 534* | scpn2.mps.gz |

This is a random test instance generator for SCP using the scheme of the following paper, namely the column cost c[j] are integer randomly generated from [1,100]; every column covers at least one row; and every row is covered by at least two columns. see reference: E. Balas and A. Ho, Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study, Mathematical Programming, 12 (1980), 37-60. We have newly generated Classes I-N with the following parameter values, where each class has five instances. We have also generated reduced instances by a standard pricing method in the following paper: S. Umetani and M. Yagiura, Relaxation heuristics for the set covering problem, Journal of the Operations Research Society of Japan, 50 (2007), 350-375. You can obtain the instance generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark

Detailed explanation of the following tables can be found here.

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

Variables | 1e+06 | 1e+06 |

Constraints | 5000 | 5000 |

Binaries | 1e+06 | 1e+06 |

Integers | 0 | 0 |

Continuous | 0 | 0 |

Implicit Integers | 0 | 0 |

Fixed Variables | 0 | 0 |

Nonzero Density | 0.0025 | 0.0025 |

Nonzeroes | 12500000 | 12500000 |

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

Total | 5000 | 5000 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 0 | 0 |

Aggregations | 0 | 0 |

Precedence | 0 | 0 |

Variable Bound | 0 | 0 |

Set Partitioning | 0 | 0 |

Set Packing | 0 | 0 |

Set Covering | 5000 | 5000 |

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

Constraint % | 100 | 100 | 100 | 100 | |

Variable % | 100 | 100 | 100 | 100 | |

Score | 0.00000 |

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 | 2 | 534 | 0 | 0 | 0 | Robert Ashford and Alkis Vazacopoulus | 2019-12-18 | Found using ODH|CPlex | |

1 | 1 | 540 | 540 | 0 | 0 | 0 | - | 2018-10-12 | Solution found during MIPLIB2017 problem selection. |

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

scpm1 | open | 500000 | 500000 | 0 | 0 | 5000 | 6250000 | Shunji Umetani | scp | 561.0* | binary set_covering |

scpl4 | open | 200000 | 200000 | 0 | 0 | 2000 | 2000000 | Shunji Umetani | scp | 263.0* | binary set_covering |

scpj4scip | open | 99947 | 99947 | 0 | 0 | 1000 | 999893 | Shunji Umetani | scp | 129.0* | binary set_covering |

scpk4 | open | 100000 | 100000 | 0 | 0 | 2000 | 1000000 | Shunji Umetani | scp | 321.0* | binary set_covering |

neos-5052403-cygnet | easy | 32868 | 32868 | 0 | 0 | 38268 | 4898300 | Jeff Linderoth | neos-pseudoapplication-100 | 182 | benchmark binary benchmark_suitable set_covering invariant_knapsack |

`No bibliographic information available`

Last Update Jun 24, 2020 by Gabriel Kressin

generated with R Markdown

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

Imprint