4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies, Volume 4

Volume 4, Number 1, March 2006

• Denis Bouyssou, Silvano Martello, Frank Plastria:
  4OR: Year 4. 1-9
  
• Denis Bouyssou, Silvano Martello, Frank Plastria:
  A case of plagiarism: Danut Marcu. 11-13
  
• Jean-Louis Bouquard, Christophe Lenté:
  Two-machine flow shop scheduling problems with minimal and maximal delays. 15-28
  
• Matthias Jach, Matthias Köppe, Robert Weismantel:
  Nondecomposable solutions to group equations and an application to polyhedral combinatorics. 29-46
  
• Xavier Gandibleux, Frédéric Beugnies, Sabine Randriamasy:
  Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function. 47-59
  
• Tom Van Woensel, Nico Vandaele:
  Empirical validation of a queueing approach to uninterrupted traffic flows. 59-72
  
• Marie-Christine Costa, Fethi Jarray, Christophe Picouleau:
  An acyclic days-off scheduling problem. 73-85
  
• Frédéric Gardi:
  Mutual exclusion scheduling with interval graphs or related classes: Complexity and algorithms. 87-90
  

Volume 4, Number 2, June 2006

• Jacek Blazewicz, Piotr Lukasiak, Maciej Milostan:
  Some operations research methods for analyzing protein sequences and structures. 91-123
  
• Roberto Cordone, Marco Trubian:
  An exact algorithm for the node weighted Steiner tree problem. 124-144
  
• Vincent Mousseau, Luis C. Dias, José Rui Figueira:
  Dealing with inconsistent judgments in multiple criteria sorting models. 145-158
  
• Tom Van Woensel, Bart Wuyts, Nico Vandaele:
  Validating state-dependent queueing models for uninterrupted traffic flows using simulation. 159-174
  

Volume 4, Number 3, September 2006

• Michela Milano, Mark Wallace:
  Integrating operations research in constraint programming. 175-219
  
• Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo:
  Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 221-238
  
• K. A. Ariyawansa, Yuntao Zhu:
  Stochastic semidefinite programming: a new paradigm for stochastic optimization. 239-253
  
• Matthieu Basseur:
  Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. 255-258
  
• Linda S. Moonen:
  Algorithms for some graph theoretical optimization problems. 259-261
  

Volume 4, Number 4, December 2006

• Fred Glover, César Rego:
  Ejection chain and filter-and-fan methods in combinatorial optimization. 263-296
  
• Fabrice Tercinet, Emmanuel Néron, Christophe Lenté:
  Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem. 297-317
  
• Corinne Feremans, Alexander Grigoriev, René Sitters:
  The geometric generalized minimum spanning tree problem with grid clustering. 319-329
  
• Katrien Ramaekers, Gerrit K. Janssens, Hendrik Van Landeghem:
  Towards logistics systems parameter optimisation through the use of response surfaces. 331-342
  
• Maria Elena Bruni:
  A decomposition-based solution method for stochastic mixed integer nonlinear programs. 343-346
  
• Hassene Aissi:
  Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. 347-350