Publicaciones (33) Publicaciones de VICENTE CAMPOS AUCEJO

2018

  1. Heuristics for the min–max arc crossing problem in graphs

    Expert Systems with Applications, Vol. 109, pp. 100-113

2017

  1. Heuristic solution approaches for the maximum minsum dispersion problem

    Journal of Global Optimization, Vol. 67, Núm. 3, pp. 671-686

  2. Randomized heuristics for the Capacitated Clustering Problem

    Information Sciences, Vol. 417, pp. 154-168

2016

  1. Strategic oscillation for the capacitated hub location problem with modular links

    Journal of Heuristics, Vol. 22, Núm. 2, pp. 221-244

2015

  1. Multiobjective GRASP with path relinking

    European Journal of Operational Research, Vol. 240, Núm. 1, pp. 54-71

  2. Tabu search and GRASP for the capacitated clustering problem

    Computational Optimization and Applications, Vol. 62, Núm. 2, pp. 589-607

2014

  1. GRASP with path relinking for the orienteering problem

    Journal of the Operational Research Society, Vol. 65, Núm. 12, pp. 1800-1813

2011

  1. Adaptive memory programming for matrix bandwidth minimization

    Annals of Operations Research, Vol. 183, Núm. 1, pp. 7-23

2008

  1. A branch and bound algorithm for the matrix bandwidth minimization

    European Journal of Operational Research, Vol. 186, Núm. 2, pp. 513-528

  2. A scatter search algorithm for the split delivery vehicle routing problem

    Studies in Computational Intelligence, Vol. 144, pp. 137-152

2007

  1. A new metaheuristic for the vehicle routing problem with split demands

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. El problema del ancho de banda

    Actas del V Congreso Español sobre Metaheurísticas, Algoritmos Evolutivos y Bioinspirados

  3. Rutas de vehículos con demanda compartida

    Actas del V Congreso Español sobre Metaheurísticas, Algoritmos Evolutivos y Bioinspirados

2006

  1. Variable neighborhood search for the linear ordering problem

    Computers and Operations Research, Vol. 33, Núm. 12, pp. 3549-3565

2005

  1. Context-independent scatter and tabu search for permutation problems

    INFORMS Journal on Computing, Vol. 17, Núm. 1, pp. 111-122

  2. Scatter search vs. genetic algorithms: An experimental evaluation with permutation problems

    Operations Research/ Computer Science Interfaces Series, Vol. 30, pp. 263-282

2004

  1. GRASP and path relinking for the matrix bandwidth minimization

    European Journal of Operational Research

2001

  1. An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem

    Journal of Global Optimization, Vol. 21, Núm. 4, pp. 397-414