Volume 42 (2008) no. 3

Table of contents

On the Steiner 2-edge connected subgraph polytope
p. 259-283
On the convex hull of projective planes
p. 285-289
Polynomial time algorithms for two classes of subgraph problem
p. 291-298
Fast computation of the leastcore and prenucleolus of cooperative games
p. 299-314
A note on the hardness results for the labeled perfect matching problems in bipartite graphs
p. 315-324
Polyhedral reformulation of a scheduling problem and related theoretical results
p. 325-359
Unified global optimality conditions for smooth minimization problems with mixed variables
p. 361-370
Enumerating the set of non-dominated vectors in multiple objective integer linear programming
p. 371-387
Une nouvelle méthode d'initialisation pour le problème de transport
p. 389-400
The inverse maximum flow problem considering l ∞ norm
p. 401-414
A memetic algorithm for the vehicle routing problem with time windows
p. 415-431