Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...