Geodesic

Sommaire du Fascicule no. 1

Genetic algorithm based approach to bi-level linear programming
p. 1-21
Global optimization by artificial life : a new technique using genetic population evolution
p. 23-36
The design and application of IPMLO. A FORTRAN library for linear optimization with interior point methods
p. 37-56
Two-dimensional combination warranty policies
p. 57-75
Sur la propriété de domination et l'existence de points Pareto-efficaces en optimisation vectorielle convexe
p. 77-84
Optimal age replacement policy of a k-out-of-n system with age-dependent minimal repair
p. 85-96
Generalized ordering policies with general random minimal repair costs and random lead times
p. 97-118

Sommaire du Fascicule no. 2

Achievable potential reductions in the method of Kojima et al. in the case of linear programming
p. 123-133
Inverse barrier methods for linear programming
p. 135-163
Bicriterion release policy for exponential software reliability growth model
p. 165-180
A note on risk averse newsboy problem
p. 181-202
Technical note on duality in linear vector maximization
p. 203-207

Sommaire du Fascicule no. 3

Optimal tool partitioning rules for numerically controlled punch press operations
p. 209-220
Ordonnancement de tâches sur un système multiprocesseur - modèles déterministes et modèles stochastiques
p. 221-253
Sur la dualité en optimisation vectorielle convexe
p. 255-281
Approximation algorithms for integer covering problems via greedy column generation
p. 283-302
A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives
p. 303-328

Sommaire du Fascicule no. 4

Probabilistic bounds on one step objective/potential function improvement in Karmarkar's algorithm
p. 329-355
Distance à centre additive
p. 357-368
Solutions of transferable utility cooperative games
p. 369-387
An economical backup warning strategy for a hard disk
p. 389-398
Fritz John's type conditions and associated duality forms in convex non differentiable vector-optimization
p. 399-412
A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set
p. 413-433