EvoCOP 2007: Valencia, Spain

• Enrique Alba, Gabriel Luque:
  A New Local Search Algorithm for the DNA Fragment Assembly Problem. 1-12
  
• Carolina P. de Almeida, Richard A. Gonçalves, Myriam Regattieri Delgado:
  A Hybrid Immune-Based System for the Protein Folding Problem. 13-24
  
• Francisco Ballestín:
  A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags. 25-35
  
• Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo:
  A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem. 36-47
  
• Matthew J. Craven:
  Genetic Algorithms for Word Problems in Partially Commutative Groups. 48-59
  
• Susana Fernandes, Helena R. Lourenço:
  A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling. 60-71
  
• Thomas Fischer, Peter Merz:
  Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges. 72-83
  
• Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihisa:
  Iterated k-Opt Local Search for the Maximum Clique Problem. 84-95
  
• Marek Kubiak, Przemyslaw Wesolek:
  Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem. 96-107
  
• Francisco Luna, Enrique Alba, Antonio J. Nebro, Salvador Pedraza:
  Evolutionary Algorithms for Real-World Instances of the Automatic Frequency Planning Problem in GSM Networks. 108-120
  
• Enrique Mota, Vicente Campos, Angel Corberán:
  A New Metaheuristic for the Vehicle Routing Problem with Split Demands. 121-129
  
• Nysret Musliu:
  Generation of Tree Decompositions by Iterated Local Search. 130-141
  
• Yuichi Nagata:
  Edge Assembly Crossover for the Capacitated Vehicle Routing Problem. 142-153
  
• Napoleão Nepomuceno, Plácido Rogério Pinheiro, André L. V. Coelho:
  Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms. 154-165
  
• Joseph M. Pasia, Karl F. Doerner, Richard F. Hartl, Marc Reimann:
  A Population-Based Local Search for Solving a Bi-objective Vehicle Routing Problem. 166-175
  
• Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger:
  Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem. 176-187
  
• Stephen Remde, Peter I. Cowling, Keshav P. Dahal, Nic Colledge:
  Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling. 188-197
  
• Enda Ridge, Daniel Kudenko:
  An Analysis of Problem Difficulty for a Class of Optimisation Heuristics. 198-209
  
• Alok Singh, Anurag Singh Baghel:
  A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem. 210-218
  
• Steffen Wolf, Peter Merz:
  A Hybrid Method for Solving Large-Scale Supply Chain Problems. 219-228
  
• Arnaud Zinflou, Caroline Gagné, Marc Gravel:
  Crossover Operators for the Car Sequencing Problem. 229-239
  

Last update Fri May 25 05:59:56 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page