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).

The aim of this volume is to provide an introduction and selective overview of the rapidly emerging field of computational economics. Computational economics provides an important set of tools that an increasing number of economists will need to acquire in order to understand and do...