Sommaire du Fascicule no. 1

Bottleneck capacity expansion problems with general budget constraints
The Lorenz transform approach to the optimal repair-cost limit replacement policy with imperfect repair
Optimal and near-optimal (s,S) inventory policies for Levy demand processes
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
Multiple routing strategies in a labelled network
On minimizing total tardiness in a serial batching problem
Complexity of partial inverse assignment problem and partial inverse cut problem
Solving the simple plant location problem by genetic algorithm

Sommaire du Fascicule no. 2

Multicriteria scheduling problems : a survey
Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine
Resource allocation in a mobile telephone network : a constructive repair algorithm
Semi-definite positive programming relaxations for graph K 𝐧 -coloring in frequency assignment
Fast simulation for road traffic network
Extension of reverse elimination method through a dynamic management of the tabu list
Separable convexification and DCA techniques for capacity and flow assignment problems
The triangles method to build X-trees from incomplete distance matrices

Sommaire du Fascicule no. 3

Efficient and local efficient solutions for assignment type problems
Finding the principal points of a random variable
État de l'art des méthodes d'« optimisation globale »
Tarification par des jeux coopératifs avec demandes élastiques

Sommaire du Fascicule no. 4

A new relaxation in conic form for the euclidean Steiner problem in ℜ n
A modified algorithm for the strict feasibility problem
Un algorithme pour la bipartition d'un graphe en sous-graphes de cardinalité fixée
Une approche hybride pour le sac à dos multidimensionnel en variables 0-1
Sur l'équilibre fort selon Berge