variables might be unbounded or restricted by a lower or upper bound, respectively. This paper describes an algorithm based on …

. When designing a genetic algorithm, there may be several alternatives for a component such as crossover, mutation or … such cases, we suggest to include alternative components into the genetic algorithm. Indicating the component to be … actually used in the genotype, this allows the genetic algorithm to adapt itself. That is, the genetic algorithm learns which …

will present a general mathematical programming algorithm which can be applied to find an element in the interval core. As …

-called peer group games being non-negative additive games on a permission tree. We provide a polynomial time algorithm for …

. Therefore a combinatorial optimisation algorithm is developed and an algorithm based on graph search is used and customised … correctness of the quick combinatorial algorithm are proved within this paper. For vehicle to grid (V2G) concepts, battery … been used to include degradation costs for different Li-Ion batteries into the graph search algorithm. An application of …

prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The …

Prefetching is a simple and general method for single-chain parallelisation of the Metropolis-Hastings algorithm based … random walk Metropolis-Hastings algorithm is obtained for a special case and it is shown to decrease in the number of …

instance anew - a heuristic that is appropriate for the instance at hand, instead of applying always the same algorithm … the experience gained in earlier iterations to guide the underlying algorithm in later iterations. In a recent study …