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

Volume 2, Number 1, March 2004

• Jawad Abrache, Teodor Gabriel Crainic, Michel Gendreau:
  Design issues for combinatorial auctions. 1-33
  
• Patrizia Beraldi, Domenico Conforti, Chefi Triki, Antonio Violi:
  Constrained auction clearing in the Italian electricity market. 35-51
  
• Jean François Maurras, Sonia Vanier:
  Network synthesis under survivability constraints. 53-67
  
• Yurij Stoyan, Guntram Scheithauer, Nikolay Gil, Tatiana Romanova:
  Phi-functions for complex 2D-objects. 69-84
  
• Benoît Colson:
  Trust-region algorithms for derivative-free optimization and nonlinear bilevel programming. 85-88
  
• Mathieu Van Vyve:
  A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. 89-91
  

Volume 2, Number 2, July 2004

• Silvano Martello:
  Stefano Pallottino (1945-2004). 93-93
  
• Jean-Pierre Brans, Giorgio Gallo:
  Ethics in OR/MS: Past, present and future. 95-110
  
• Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky:
  Ten notes on equal-processing-time scheduling. 111-127
  
• Marc Sevaux, Kenneth Sörensen:
  A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates. 129-147
  
• Annegret Wagler:
  Antiwebs are rank-perfect. 149-152
  
• Michelangelo Conforti, Romeo Rizzi:
  Combinatorial optimization - Polyhedra and efficiency: A book review. 153-159
  
• Giorgio Fasano:
  A MIP approach for some practical packing problems: Balancing constraints and tetris-like items. 161-174
  
• Hande Yaman:
  Concentrator location in telecommunications. 175-177
  

Volume 2, Number 3, October 2004

• Jean-Pierre Barthélemy, François Brucker, Christophe Osswald:
  Combinatorial optimization and hierarchical classifications. 179-219
  
• Robert D. Carr, Giuseppe Lancia:
  Compact optimization can outperform separation: A case study in structural proteomics. 221-233
  
• Thierry Benoist, Benoît Rottembourg:
  Upper bounds for revenue maximization in a satellite scheduling problem. 235-249
  
• Roel Leus:
  The generation of stable project plans. 251-254
  
• Leo Liberti:
  Reformulation and convex relaxation techniques for global optimization. 255-258
  

Volume 2, Number 4, December 2004

• Jakob Krarup, Malene Nordlund Rørbech:
  LP formulations of the shortest path tree problem. 259-274
  
• Bruno Bachelet, Philippe Mahey:
  Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs. 275-291
  
• Raymond Bisdorff:
  Concordant outranking with multiple criteria of ordinal significance. 293-308
  
• Mustafa Ç. Pinar:
  A note on robust 0-1 optimization with uncertain cost coefficients. 309-316
  
• Alberto Caprara:
  Knapsack problems: A book review. 317-320
  
• Emilie Danna:
  Integrating local search techniques into mixed integer programming. 321-324
  
• Olivier Spanjaard:
  Non-classical preference models in combinatorial problems: Models and algorithms for graphs. 325-328