Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Pèrez, Josè Andrès Moreno"'
Publikováno v:
Proceedings of MIC 2017: The XII Metaheuristics International Conference, Barcelona, Spain, pages 241-243
A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph with the mini
Externí odkaz:
http://arxiv.org/abs/1807.00570
In this paper we describe an extension of the Variable Neighbourhood Search (VNS) which integrates the basic VNS with other complementary approaches from machine learning, statistics and experimental algorithmic, in order to produce high-quality perf
Externí odkaz:
http://arxiv.org/abs/1509.08792
Publikováno v:
Computer Aided Systems Theory, pages 79-80 (2015)
In a currently ongoing project, we investigate a new possibility for solving the k-labelled spanning forest (kLSF) problem by an intelligent Variable Neighbourhood Search (Int-VNS) metaheuristic. In the kLSF problem we are given an undirected input g
Externí odkaz:
http://arxiv.org/abs/1503.02009
Publikováno v:
In Electronic Notes in Discrete Mathematics February 2015 47:29-36
