Geodesic

Sommaire du Fascicule no. 1

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

Sommaire du Fascicule no. 2

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

Sommaire du Fascicule no. 3

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
p. 179-207
Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
p. 209-222
Some aspects of balking and reneging in finite buffer queues
p. 223-240
A survey on combinatorial optimization in dynamic environments
p. 241-294

Sommaire du Fascicule no. 4

On the complexity of problems on simple games
p. 295-314
On designing connected rapid transit networks reducing the number of transfers
p. 315-338
Bootstrap clustering for graph partitioning
p. 339-352