RAIRO - Operations Research

Vol. 42 No. 3 (July-September 2008)

• On the Steiner 2-edge connected subgraph polytope     p. 259
  A. Rhida Mahjoub and Pierre Pesneau
  Abstract | PDF file (353.8 KB) | References



• On the convex hull of projective planes     p. 285
  Jean-François Maurras and Roumen Nedev
  Abstract | PDF file (122.9 KB) | References



• Polynomial time algorithms for two classes of subgraph problem     p. 291
  Sriraman Sridharan
  Abstract | PDF file (224.9 KB) | References



• Fast computation of the leastcore and prenucleolus of cooperative games     p. 299
  Joseph Frédéric Bonnans and Matthieu André
  Abstract | PDF file (222.2 KB) | References



• A note on the hardness results for the labeled perfect matching problems in bipartite graphs     p. 315
  Jérôme Monnot
  Abstract | PDF file (180.4 KB) | References



• Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results     p. 325
  Jean Damay, Alain Quilliot and Eric Sanlaville
  Abstract | PDF file (396.5 KB) | References



• Unified global optimality conditions for smooth minimization problems with mixed variables     p. 361
  Vaithilingam Jeyakumar, Sivakolundu Srisatkunarajah and Nguyen Quang Huy
  Abstract | PDF file (160.6 KB) | References



• Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming     p. 371
  John Sylva and Alejandro Crema
  Abstract | PDF file (390.8 KB) | References



• Une nouvelle méthode d'initialisation pour le problème de transport     p. 389
  François Dubeau and Oumar Mandione Guèye
  Abstract | PDF file (164.6 KB) | References



• The inverse maximum flow problem considering norm     p. 401
  Adrian Deaconu
  Abstract | PDF file (271.2 KB) | References



• A memetic algorithm for the vehicle routing problem with time windows     p. 415
  Nacima Labadi, Christian Prins and Mohamed Reghioui
  Abstract | PDF file (238.5 KB) | References