A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem
| Year of publication: |
November 2017
|
|---|---|
| Authors: | Wang, Yiyuan ; Yin, Minghao ; Ouyang, Dantong ; Zhang, Liming |
| Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 24.2017, 6, p. 1463-1485
|
| Subject: | set k-covering problem | configuration checking | scoring mechanism | local search | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A hybrid of max-min ant system and linear programming for the k-covering problem
Al-Shihabi, Sameh, (2016)
-
Approximation algorithms for the 𝜅⁺-star packing problem
Huang, Zhihua, (2025)
-
The Euclidean k-supplier problem in IR²
Basappa, Manjanna, (2021)
- More ...
-
An improved configuration checking-based algorithm for the unicost set covering problem
Wang, Yiyuan, (2021)
-
Towards more efficient local search for weighted graph coloring problem in massive graphs
Pan, Shiwei, (2025)
-
An efficient local search algorithm for minimum positive influence dominating set problem
Sun, Rui, (2023)
- More ...