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)
-
Human-centric parcel delivery at deutsche post with operations research and machine learning
Arıkan, Uğur, (2023)
-
An efficient local search heuristic for the double row layout problem with asymmetric material flow
Murray, Chase C., (2013)
- More ...
-
ILSGVCP : an improved local search algorithm for generalized vertex cover problem
Tai, Ran, (2023)
-
MLQCC : an improved local search algorithm for the set<i>k</i>‐covering problem
Wang, Yiyuan, (2018)
-
NuMWVC : a novel local search for minimum weighted vertex cover problem
Li, Ruizhi, (2020)
- More ...