We are interested by Lyapounov exponents in the almost periodic Hamiltonian case.

In this paper we present a meta-heuristic, known as a genetic algorithm, in order to solve the problems of (weigthed) independent set (IS), vertex covering (VC), set packing (SP) and maximum clique (MC).