A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem

DOI10.1111/itor.12280zbMath1386.90130OpenAlexW2343848941MaRDI QIDQ4601636

Dantong Ouyang, Minghao Yin, Yiyuan Wang, Li-Ming Zhang

Publication date: 24 January 2018

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12280

zbMATH Keywords

local searchconfiguration checkingscoring mechanismset \(k\)-covering problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (5)

MLQCC: an improved local search algorithm for the set k‐covering problem ⋮ An optimization method for characterizing two groups of data ⋮ An efficient heuristic algorithm for solving connected vertex cover problem ⋮ Local search for diversified top-\(k\) clique search problem ⋮ New heuristic approaches for maximum balanced biclique problem

This page was built for publication: A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem