Tome 45 (2011) no. 2

Sommaire

Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
p. 75-100
Minmax regret combinatorial optimization problems: an Algorithmic Perspective
p. 101-129
A discrete-time Geo [X] /G/1 retrial queue with general retrial time and M-additional options for service
p. 131-152
A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components
p. 153-178