Annals of Operations Research, Volume 131

Volume 131, Numbers 1-4, October 2004

• Ulrich Derigs, Stefan Voß:
  Preface. 17-20
  
• Samad Ahmadi, Ibrahim H. Osman:
  Density Based Problem Space Search for the Capacitated Clustering p-Median Problem. 21-43
  
• Ulrich Derigs, Nils-H. Nickel:
  On a Local-Search Heuristic for a Class of Tracking Error Minimization Problems in Portfolio Management. 45-77
  
• Karl F. Doerner, Walter J. Gutjahr, Richard F. Hartl, Christine Strauss, Christian Stummer:
  Pareto Ant Colony Optimization: A Metaheuristic Approach to Multiobjective Portfolio Selection. 79-99
  
• Huang Wenqi, Kang Yan:
  A Short Note on a Simple Search Heuristic for the Diskspacking Problem. 101-108
  
• Ilfat Ghamlouche, Teodor Gabriel Crainic, Michel Gendreau:
  Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design. 109-133
  
• Andrzej Jaszkiewicz:
  A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm. 135-158
  
• Philippe Lacomme, Christian Prins, Wahiba Ramdane-Chérif:
  Competitive Memetic Algorithms for Arc Routing Problems. 159-185
  
• François-Xavier Le Louarn, Michel Gendreau, Jean-Yves Potvin:
  GENI Ants for the Traveling Salesman Problem. 187-201
  
• Andrea Lodi, Silvano Martello, Daniele Vigo:
  TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems. 203-213
  
• Carlo Meloni, Dario Pacciarelli, Marco Pranzo:
  A Rollout Metaheuristic for Job Shop Scheduling Problems. 215-235
  
• Mireille Palpant, Christian Artigues, Philippe Michelon:
  LSSPER: Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search. 237-257
  
• Gintaras Palubeckis:
  Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem. 259-282
  
• Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin:
  An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem. 283-304
  
• Vicente Valls, Francisco Ballestín, Sacramento Quintanilla:
  A Population-Based Approach to the Resource-Constrained Project Scheduling Problem. 305-324
  
• Chris Walshaw:
  Multilevel Refinement for Combinatorial Optimisation Problems. 325-372
  
• Mark Zlochin, Mauro Birattari, Nicolas Meuleau, Marco Dorigo:
  Model-Based Search for Combinatorial Optimization: A Critical Survey. 373-395