Geodesic

Sommaire du Fascicule no. 1

Editorial
p. 1-2
MEMOTS : a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
p. 3-33
Combination of mobile agent and evolutionary algorithm to optimize the client transport services
p. 35-67
Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery
p. 69-83

Sommaire du Fascicule no. 2

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

Sommaire du Fascicule no. 3

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

Sommaire du Fascicule no. 4

ALIO/EURO V conference on combinatorial optimization
p. 433-434
A branch-and-price-and-cut algorithm for the pattern minimization problem
p. 435-453
Acyclic orientations with path constraints
p. 455-467
Comparison of algorithms in graph partitioning
p. 469-484
Comparing imperfection ratio and imperfection index for graph classes
p. 485-500
Three tabu search methods for the MI-FAP applied to 802.11 networks
p. 501-514