In this paper, we use the exact model (or dynamical system approach) to describe the standard evolutionary algorithm (EA) as a discrete dynamical system for dynamic optimization pr...
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
ABSTRACT. In this paper we discuss an abstract iteration scheme for the calculation of the smallest eigenvalue of an elliptic operator eigenvalue problem. A short and geometric pro...
Thorsten Rohwedder, Reinhold Schneider, Andreas Ze...
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous ...