A fast vertex weighting-based local search for finding minimum connected dominating sets
Year of publication: |
2022
|
---|---|
Authors: | Wu, Xinyun ; Lü, Zhipeng ; Glover, Fred |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 2, p. 817-833
|
Subject: | local search | metaheuristic | minimum dominating set | search space reduction | vertex weighting | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Algorithmus | Algorithm | Graphentheorie | Graph theory | Suchtheorie | Search theory |
-
Multistart search for the cyclic cutwidth minimization problem
Cavero, Sergio, (2021)
-
Optimizing node infiltrations in complex networks by a local search based heuristic
Lozano, Manuel, (2019)
-
A fast local search algorithm for minimum sum coloring problem on massive graphs
Li, Yan, (2024)
- More ...
-
A matheuristic for a telecommunication network design problem with traffic grooming
Wu, Xinyun, (2019)
-
Iterated dynamic neighborhood search for packing equal circles on a sphere
Lai, Xiangjing, (2023)
-
Diversification-driven tabu search for unconstrained binary quadratic problems
Glover, Fred, (2010)
- More ...