Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Taoqing Zhou"'
Publikováno v:
IEEE Access, Vol 5, Pp 19248-19258 (2017)
This paper presents a quality and distance guided metaheuristic algorithm (QD-ILS) for solving the vertex separation problem. QD-ILS integrates a basic local search procedure with QD-LS strategy, which uses an augmented evaluation function that consi
Externí odkaz:
https://doaj.org/article/e3861e9ed7e34effb50239eecf81356e
Publikováno v:
Computers & Operations Research. 78:255-266
This paper presents a quality and distance guided local search (QD-LS) as the diversification strategy for metaheuristics. QD-LS uses an augmented evaluation function which considers both solution quality and distance between the current solution and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d48628d3b9ee2187c3e9e1e3ad9e2e8
https://doi.org/10.1016/j.cor.2016.09.012
https://doi.org/10.1016/j.cor.2016.09.012
Publikováno v:
IEEE Access, Vol 5, Pp 19248-19258 (2017)
This paper presents a quality and distance guided metaheuristic algorithm (QD-ILS) for solving the vertex separation problem. QD-ILS integrates a basic local search procedure with QD-LS strategy, which uses an augmented evaluation function that consi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5edf356afd46bc384a7520b9b1b13100
https://ieeexplore.ieee.org/document/8012354/
https://ieeexplore.ieee.org/document/8012354/
Publikováno v:
SCIENTIA SINICA Informationis. 46:445-460
This paper presents a variable-depth neighborhood search (VDNS) algorithm for solving the minimum-connected dominating-set problem. By considering the problem structure of the minimum-connected dominating-set problem, this paper introduces an effecti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0779420071e0225485c73eea24a89ae2
https://doi.org/10.1360/n112015-00128
https://doi.org/10.1360/n112015-00128
Publikováno v:
Journal of Combinatorial Optimization. 32:368-384
The minimum weight vertex cover problem (MWVCP) is one of the most popular combinatorial optimization problems with various real-world applications. Given an undirected graph where each vertex is weighted, the MWVCP is to find a subset of the vertice
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::329125e19dabd12cc8f9ad7d848ff992
https://doi.org/10.1007/s10878-015-9909-3
https://doi.org/10.1007/s10878-015-9909-3
Publikováno v:
Combinatorial Optimization and Applications ISBN: 9783319711461
COCOA (2)
COCOA (2)
Some optimization problems need to finding a permutation of a given set of items that minimizes a certain cost function. This paper introduces an effective memetic algorithm for the linear ordering problem with cumulative costs (LOPCC). The proposed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4feb038a3e3d1ac71e6defe6d4fa79a7
https://doi.org/10.1007/978-3-319-71147-8_39
https://doi.org/10.1007/978-3-319-71147-8_39
