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

Volume 3, Number 1, March 2005

• Vincent T'Kindt, Karima Bouibede-Hocine, Carl Esswein:
  Counting and enumeration complexity with application to multicriteria scheduling. 1-21
  Electronic Edition (link) BibTeX
• Pasquale Avella, Maurizio Boccia, Carmine Di Martino, Giuseppe Oliviero, Antonio Sforza, Igor Vasil'ev:
  A decomposition approach for a very large scale optimal diversity management problem. 23-37
  Electronic Edition (link) BibTeX
• Hafida Essaqote, Noureddine Zahid, Mohamed Limouri, Abderrahmane Essaid:
  A new approach for unsupervised classification. 39-49
  Electronic Edition (link) BibTeX
• Edmond J. Vanderperre, Stanislav S. Makhanov:
  A Markov time related to a robot-safety device system. 51-57
  Electronic Edition (link) BibTeX
• Philippe Galinier, Michel Gendreau, Patrick Soriano, Serge Bisaillon:
  Solving the frequency assignment problem with polarization by local search and tabu. 59-78
  Electronic Edition (link) BibTeX
• Pietro Belotti:
  Multicommodity network design with survivability constraints: Some models and algorithms. 79-81
  Electronic Edition (link) BibTeX
• Xavier Delorme:
  Railroad infrastructure operations : Modeling and resolution. 83-86
  Electronic Edition (link) BibTeX

Volume 3, Number 2, June 2005

• Benoît Colson, Patrice Marcotte, Gilles Savard:
  Bilevel programming: A survey. 87-107
  Electronic Edition (link) BibTeX
• Zvi Drezner:
  A distance based rule for removing population members in genetic algorithms. 109-116
  Electronic Edition (link) BibTeX
• Natalia V. Shakhlevich:
  Open shop unit-time scheduling problems with symmetric objective functions. 117-131
  Electronic Edition (link) BibTeX
• Cyriel Van Nuffelen, Kristel Van Rompay:
  On the length of longest chordless cycles. 133-138
  Electronic Edition (link) BibTeX
• Alain Hertz, David Schindl, Nicolas Zufferey:
  Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. 139-161
  Electronic Edition (link) BibTeX
• Manuel Iori:
  Metaheuristic algorithms for combinatorial optimization problems. 163-166
  Electronic Edition (link) BibTeX
• Claude Yugma:
  Dynamic management of a portfolio of orders. 167-170
  Electronic Edition (link) BibTeX

Volume 3, Number 3, September 2005

• Dorit S. Hochbaum:
  Complexity and algorithms for convex network optimization and other nonlinear problems. 171-216
  Electronic Edition (link) BibTeX
• Moncef Abbas, Youcef Saoula:
  Polynomial algorithms for kernels in comparability, permutation and P₄-free graphs. 217-225
  Electronic Edition (link) BibTeX
• Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint:
  Sensitivity of trust-region algorithms to their parameters. 227-241
  Electronic Edition (link) BibTeX
• Dominique de Werra, Pierre Hansen:
  Variations on the Roy-Gallai theorem. 243-251
  Electronic Edition (link) BibTeX
• Hartanto Wong:
  Pooling of repairable spare parts: A study on inventory policies. 253-256
  Electronic Edition (link) BibTeX

Volume 3, Number 4, December 2005

• Julia Pahl, Stefan Voß, David L. Woodruff:
  Production planning with load dependent lead times. 257-302
  Electronic Edition (link) BibTeX
• Mikhail A. Kubzin, Vitaly A. Strusevich:
  Two-machine flow shop no-wait scheduling with machine maintenance. 303-313
  Electronic Edition (link) BibTeX
• Roberto Montemanni, Luca Maria Gambardella:
  The robust shortest path problem with interval data via Benders decomposition. 315-328
  Electronic Edition (link) BibTeX
• Annegret Wagler:
  On rank-perfect subclasses of near-bipartite graphs. 329-336
  Electronic Edition (link) BibTeX
• Fethi Jarray:
  Solving problems of discrete tomography. 337-340
  Electronic Edition (link) BibTeX
• Denis Bouyssou, Silvano Martello, Frank Plastria:
  Acknowledgement to referees. 341-342
  Electronic Edition (link) BibTeX