Abstract

In this paper, I introduce a new family of scheduling and routing problems. These problems are called the k-cycling dinner problems. Given a graph, the problem is to find a set of tuples of nodes for which the distance between these nodes is minimized under the following three constraints. Each
... read more