Sommaire du Fascicule no. 1

Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices
Computational schemes for two exponential servers where the first has a finite buffer
Balancing the stations of a self service “bike hire” system
Flexible measures in production process: A DEA-based approach

Sommaire du Fascicule no. 2

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

Sommaire du Fascicule no. 3

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
Some aspects of balking and reneging in finite buffer queues
A survey on combinatorial optimization in dynamic environments

Sommaire du Fascicule no. 4

On the complexity of problems on simple games
On designing connected rapid transit networks reducing the number of transfers
Bootstrap clustering for graph partitioning