Sommaire du Fascicule no. 1

Editorial
MEMOTS : a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
Combination of mobile agent and evolutionary algorithm to optimize the client transport services
Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery

Sommaire du Fascicule no. 2

Éditorial
Existence of solutions to weak nonlinear bilevel problems via MinSup and d.c. problems
Quadratic 0-1 programming : tightening linear or quadratic convex reformulation by use of relaxations
A logarithm barrier method for semi-definite programming
La différentiation automatique et son utilisation en optimisation
Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications
Generic primal-dual interior point methods based on a new kernel function
New representation to reduce the search space for the resource-constrained project scheduling problem
Solution approaches to large shift scheduling problems

Sommaire du Fascicule no. 3

On the Steiner 2-edge connected subgraph polytope
On the convex hull of projective planes
Polynomial time algorithms for two classes of subgraph problem
Fast computation of the leastcore and prenucleolus of cooperative games
A note on the hardness results for the labeled perfect matching problems in bipartite graphs
Polyhedral reformulation of a scheduling problem and related theoretical results
Unified global optimality conditions for smooth minimization problems with mixed variables
Enumerating the set of non-dominated vectors in multiple objective integer linear programming
Une nouvelle méthode d'initialisation pour le problème de transport
The inverse maximum flow problem considering l ∞ norm
A memetic algorithm for the vehicle routing problem with time windows

Sommaire du Fascicule no. 4

ALIO/EURO V conference on combinatorial optimization
A branch-and-price-and-cut algorithm for the pattern minimization problem
Acyclic orientations with path constraints
Comparison of algorithms in graph partitioning
Comparing imperfection ratio and imperfection index for graph classes
Three tabu search methods for the MI-FAP applied to 802.11 networks