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