Search Results - "Moreno Pérez, José Andrés"

Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem by Consoli, Sergio, Moreno-Pérez, José Andrés, Darby-Dowman, Kenneth, Mladenović, Nenad

“…Particle Swarm Optimization is a population-based method inspired by the social behaviour of individuals inside swarms in nature. Solutions of the problem are…”
Get full text

Variable neighbourhood search for the minimum labelling Steiner tree problem by Consoli, Sergio, Darby-Dowman, Kenneth, Mladenović, Nenad, Moreno-Pérez, José Andrés

“…We present a study on heuristic solution approaches to the minimum labelling Steiner tree problem, an NP-hard graph problem related to the minimum labelling…”
Get full text

Comparison of metaheuristics for the k‐labeled spanning forest problem by Consoli, Sergio, Moreno Pérez, José Andrés, Mladenović, Nenad

“…In this paper, we study the k‐labeled spanning forest (kLSF) problem in which an undirected graph whose edges are labeled and an integer‐positive value k¯ are…”
Get full text

Variable neighbourhood search for the k-labelled spanning forest problem by Consoli, Sergio, Pérez, José Andrés Moreno

“…In this paper we present an efficient Variable Neighbourhood Search for the k-labelled spanning forest (kLSF) problem, an NP-hard graph problem related to the…”
Get full text

Solving the minimum labelling spanning tree problem by intelligent optimization by Consoli, S., Mladenović, N., Moreno Pérez, J.A.

“…[Display omitted] •Minimum labelling spanning tree problem on graphs and networks.•Solution approach for the problem using intelligent optimization…”
Get full text

Localización competitiva con valoraciones difusas de los clientes by Santos Peñate, Dolores Rosa, Moreno Pérez, José Andrés, Campos Rodríguez, Clara M

“…A competitive location problem with two firms consists of locating the facilities of these two firms in order to optimize certain objectives. Normally, the…”
Get full text

Competencia espacial por cuotas de mercado: el problema del líder-seguidor mediante programación lineal by Santos Peñate, Dolores Rosa, Moreno Pérez, José Andrés, Campos Rodríguez, Clara M

“…In this paper we consider a location problem where two firms enter the market sequentially, competing for capturing customers located at a finite set of…”
Get full text

Minimum Labelling bi-Connectivity by Perez, Jose' Andres Moreno, Consoli, Sergio

“…Proceedings of MIC 2017: The XII Metaheuristics International Conference, Barcelona, Spain, pages 241-243 A labelled, undirected graph is a graph whose edges…”
Get full text

An intelligent extension of Variable Neighbourhood Search for labelling graph problems by Consoli, Sergio, Pèrez, Josè Andrès Moreno

“…In this paper we describe an extension of the Variable Neighbourhood Search (VNS) which integrates the basic VNS with other complementary approaches from…”
Get full text

Towards an intelligent VNS heuristic for the k-labelled spanning forest problem by Consoli, Sergio, Pèrez, Josè Andrès Moreno, Mladenovic, Nenad

“…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…”
Get full text

Mejora de la exploracion y la explotacion de las heuristicas constructivas para el MLSTP by Consoli, Sergio, Moreno-Perez, Jose Andres, Darby-Dowman, Kenneth, Mladenovic, Nenad

“…This paper studies constructive heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree that uses edges that…”
Get full text

Solving the minimum labelling spanning tree problem using intelligent optimization by Consoli, Sergio, Mladenovic, Nenad, Moreno-Perez, Jose Andres

“…Given a connected, undirected graph whose edges are labelled (or coloured), the minimum labelling spanning tree (MLST) problem seeks a spanning tree whose…”
Get full text