HM 2004: Valencia, Spain

• Marc Reimann, Marco Laumanns:
  A hybrid ACO algorithm for the Capacitated Minimum Spanning Tree Problem. 1-10
  
• Sameh Al-Shihabi:
  Ants for Sampling in the Nested Partition Algorithm. 11-18
  
• Roberto P. Souto, Haroldo F. de Campos Velho, Stephan Stephany, Sandra A. Sandri:
  Reconstruction of Chlorophyll Concentration Profile in Offshore Ocean Water using a Parallel Ant Colony Code. 19-24
  
• António Gaspar-Cunha, Armando Vieira:
  A Hybrid Multi-Objective Evolutionary Algorithm Using an Inverse Neural Network. 25-30
  
• Kaveh Sheibani:
  An Adaptive Greedy Genetic Algorithm Using Fuzzy Reasoning for the Travelling Salesman Problem. 31-50
  
• Noureddine Bouhmala:
  Combining Local Search with the Multilevel Paradigm for the Traveling Salesman Problem. 51-58
  
• Miguel García-Torres, Félix C. García López, Belén Melián-Batista, José A. Moreno-Pérez, J. Marcos Moreno-Vega:
  Solving Feature Subset Selection Problem by a Hybrid Metaheuristic. 59-68
  
• Marcos Henrique Ribeiro, Viviane de Aragao Trindade, Alexandre Plastino, Simone L. Martins:
  Hybridization of GRASP Metaheuristics with Data Mining Techniques. 69-78
  
• Jesús David Beltrán, Jose Eduardo Calderón, Rayco Jorge Cabrera, José A. Moreno-Pérez, J. Marcos Moreno-Vega:
  GRASP-VNS hybrid for the Strip Packing Problem. 79-90
  
• Pierre Chardaire, Geoff P. McKeown, Jameel A. Maki:
  Hybridizing GRASP, PROBE and Path Relinking. 91-100
  
• Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki:
  One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming. 101-114
  
• Dagmar Monett Díaz:
  +CARPS: Configuration of Metaheuristics based on JADE Agents. 115-126
  
• El-Ghazali Talbi, Vincent Bachelet:
  COSEARCH: A Parallel Co-evolutionary Metaheuristic. 127-140
  

Last update Tue Feb 14 03:58:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page