scpm1
binary set_covering
| Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
|---|---|---|---|---|---|---|---|
| Shunji Umetani | 500000 | 5000 | 2.5e-03 | open | scp | 540.0* | scpm1.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
Location of instance in collection
Instance Statistics
Detailed explanation of the following tables can be found here.
| Original | Presolved | |
|---|---|---|
| Variables | 5e+05 | 5e+05 |
| Constraints | 5000 | 5000 |
| Binaries | 5e+05 | 5e+05 |
| Integers | 0 | 0 |
| Continuous | 0 | 0 |
| Implicit Integers | 0 | 0 |
| Fixed Variables | 0 | 0 |
| Nonzero Density | 0.0025 | 0.0025 |
| Nonzeroes | 6250000 | 6250000 |
| 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 |
Structure
Available nonzero structure and decomposition information. Further information can be found here.
Nonzero entries of original problem
Nonzero entries after trivial presolving
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 |
Best Known Solution(s)
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 |
|---|---|---|---|---|---|---|---|---|
| 7 | 540 | 540 | 0 | 0 | 0 | Mars Davletshin | 2024-08-15 | It was obtained by Huawei OptVerse solver using ML-based LNS. |
| 6 | 542 | 542 | 0 | 0 | 0 | Yuya Hattori | 2023-08-23 | The solution was obtained by weighted local search with exploiting variable associations. |
| 5 | 544 | 544 | 0 | 0 | 0 | Peng Lin, Shaowei Cai, Mengchuan Zou, Jinkun Lin | 2023-05-03 | Computed by local search based on the paper Peng Lin, Shaowei Cai, Mengchuan Zou, and Jinkun Lin. “New Characterizations and Efficient Local Search for General Integer Linear Programming”, arXiv preprint arXiv:2305.00188 (2023). |
| 4 | 554 | 554 | 0 | 0 | 0 | Ishibashi Yasumi | 2021-05-12 | Obtained with NuOpt (https://www.msi.co.jp/nuopt/english/) by weighting local search with exploiting variable associations (WLS) |
| 3 | 557 | 557 | 0 | 0 | 0 | Yuji Koguma | 2020-09-30 | Obtained with a Tabu Search algorithm based on the paper, Koji Nonobe, Toshihide Ibaraki: “An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem,” INFOR, Vol.39, No.2, pp.131-151, 2001. |
| 2 | 561 | 561 | 0 | 0 | 0 | Shunsuke Kamiya | 2020-05-17 | Computed with weighting local search with exploiting variable associations (WLS) ([1]) [1] Umetani, Shunji. “Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs.” European Journal of Operational Research 263.1 (2017): 72-81. |
| 1 | 592 | 592 | 0 | 0 | 0 | - | 2018-10-12 | Solution found during MIPLIB2017 problem selection. |
Similar instances in collection
The following instances are most similar to scpm1 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
| scpl4 | open | 200000 | 200000 | 0 | 0 | 2000 | 2000000 | Shunji Umetani | scp | 259.0* | binary set_covering |
| scpn2 | open | 1000000 | 1000000 | 0 | 0 | 5000 | 12500000 | Shunji Umetani | scp | 489.0* | binary set_covering |
| scpj4scip | open | 99947 | 99947 | 0 | 0 | 1000 | 999893 | Shunji Umetani | scp | 128* | binary set_covering |
| scpk4 | open | 100000 | 100000 | 0 | 0 | 2000 | 1000000 | Shunji Umetani | scp | 318.0* | binary set_covering |
| ex1010-pi | open | 25200 | 25200 | 0 | 0 | 1468 | 102114 | M. Winkler | – | 233.0* | binary set_covering |
Reference
No bibliographic information availableLast Update 2024 by Julian Manns
generated with R Markdown
© by Zuse Institute Berlin (ZIB)
Imprint