Geodesic

Volume 19 (2012) no. 2

Table of contents

Decidability conditions for problems about automata reading infinite words
p. 3-18
Tabu search for the discrete $(r|p)$-centroid problem
p. 19-40
Genetic algorithm with tournament selection as a local search method
p. 41-53
On a two-machine routing open shop problem on a two-node network
p. 54-74
Construction of Hamiltonian cycles with a given range of directions of edges in the Boolean $n$-dimensional cube
p. 75-83
On the admissible families of components of Hamming codes
p. 84-91
Approximation scheme for one problem of a vector subset choice
p. 92-100