RAIRO - Operations Research - Recherche Opérationnelle, Tome 42 (2008) no. 3

Sommaire

On the Steiner

2

-edge connected subgraph polytope

Mahjoub, A. Rhida ; Pesneau, Pierre

p. 259-283

On the convex hull of projective planes

Maurras, Jean-François ; Nedev, Roumen

p. 285-289

Polynomial time algorithms for two classes of subgraph problem

Sridharan, Sriraman

p. 291-298

Fast computation of the leastcore and prenucleolus of cooperative games

Bonnans, Joseph Frédéric ; André, Matthieu

p. 299-314

A note on the hardness results for the labeled perfect matching problems in bipartite graphs

Monnot, Jérôme

p. 315-324

Polyhedral reformulation of a scheduling problem and related theoretical results

Damay, Jean ; Quilliot, Alain ; Sanlaville, Eric

p. 325-359

Unified global optimality conditions for smooth minimization problems with mixed variables

Jeyakumar, Vaithilingam ; Srisatkunarajah, Sivakolundu ; Huy, Nguyen Quang

p. 361-370

Enumerating the set of non-dominated vectors in multiple objective integer linear programming

Sylva, John ; Crema, Alejandro

p. 371-387

Une nouvelle méthode d'initialisation pour le problème de transport

Dubeau, François ; Guèye, Oumar Mandione

p. 389-400

The inverse maximum flow problem considering

l_{\infty}

norm

Deaconu, Adrian

p. 401-414

A memetic algorithm for the vehicle routing problem with time windows

Labadi, Nacima ; Prins, Christian ; Reghioui, Mohamed

p. 415-431