Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
Karl F. Doerner, Guenther Fuellerer, Richard F. Ha...