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

Volume 1, Number 1, March 2003

• Denis Bouyssou, Silvano Martello, Frank Plastria:
  4OR for what purpose? 1-6
  Electronic Edition (link) BibTeX
• Claude Lemaréchal:
  The omnipresence of Lagrange. 7-25
  Electronic Edition (link) BibTeX
• Marco A. Boschetti, Aristide Mingozzi:
  The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. 27-42
  Electronic Edition (link) BibTeX
• Cyriel Van Nuffelen, Kristel Van Rompay:
  Upper bounds on the independence and the clique covering number. 43-50
  Electronic Edition (link) BibTeX
• Emilio Spedicato, Elena Bodon, Antonino Del Popolo, Nezam Mahdavi-Amiri:
  ABS methods and ABSPACK for linear systems and optimization: A review. 51-66
  Electronic Edition (link) BibTeX
• Roberto Aringhieri, Pierre Hansen, Federico Malucelli:
  Chemical trees enumeration algorithms. 67-83
  Electronic Edition (link) BibTeX
• Michele Monaci:
  Algorithms for packing and scheduling problems. 85-87
  Electronic Edition (link) BibTeX

Volume 1, Number 2, June 2003

• Jean-François Cordeau, Gilbert Laporte:
  The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. 89-101
  Electronic Edition (link) BibTeX
• Alessandro Agnetis, Paolo Detti, Carlo Meloni:
  Process selection and sequencing in a two-agents production system. 103-119
  Electronic Edition (link) BibTeX
• Ernesto de Queirós Vieira Martins, Marta M. B. Pascoal:
  A new implementation of Yen's ranking loopless paths algorithm. 121-133
  Electronic Edition (link) BibTeX
• Marco A. Boschetti, Aristide Mingozzi:
  The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds. 135-147
  Electronic Edition (link) BibTeX
• Francesco Maffioli:
  The vehicle routing problem: A book review. 149-153
  Electronic Edition (link) BibTeX
• Tito A. Ciriani, Yves Colombani, Susanne Heipcke:
  Embedding optimisation algorithms with Mosel. 155-167
  Electronic Edition (link) BibTeX
• Luc Muyldermans:
  Routing, districting and location for arc traversal problems. 169-172
  Electronic Edition (link) BibTeX

Volume 1, Number 3, October 2003

• Quentin Louveaux, Laurence A. Wolsey:
  Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. 173-207
  Electronic Edition (link) BibTeX
• Adam N. Letchford, Andrea Lodi:
  Primal separation algorithms. 209-224
  Electronic Edition (link) BibTeX
• Jérôme Monnot, Olivier Spanjaard:
  Bottleneck shortest paths on a partially ordered scale. 225-241
  Electronic Edition (link) BibTeX
• Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco:
  A note on a new variant of Murty's ranking assignments algorithm. 243-255
  Electronic Edition (link) BibTeX
• Roberto Montemanni:
  Upper and lower bounds for the fixed spectrum frequency assignment problem. 257-260
  Electronic Edition (link) BibTeX

Volume 1, Number 4, December 2003

• Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano:
  Models and solution techniques for frequency assignment problems. 261-317
  Electronic Edition (link) BibTeX
• Alberto Ceselli:
  Two exact algorithms for the capacitated p-median problem. 319-340
  Electronic Edition (link) BibTeX
• Kenneth Sörensen:
  A framework for robust and flexible optimisation using metaheuristics. 341-345
  Electronic Edition (link) BibTeX
• Denis Bouyssou, Silvano Martello, Frank Plastria:
  Acknowledgement to referees. 347-348
  Electronic Edition (link) BibTeX