We consider a routing problem for a single vehicle serving customer locations in the course of time. A subset of these customers must necessarily be served, while the complement of this subset contains dynamic customers which request for service over time, and which do not necessarily need to be served. The decision maker’s conflicting goals are serving as many customers as possible as well as ...

Open Access Week, starting 24 October 2016, is a worldwide event established to promote the potential benefits of open access and to foster wider participation in helping to make open access the norm in research and information sharing. In its eighth year, Open Access Week presents an opportunity for funding bodies, universities and others to use the context to advance policy changes in favour ...

We propose a general technique related to the polytopal Sperner lemma for proving old and new multilabeled versions of Sperner’s lemma. A notable application of this technique yields a cake-cutting theorem where the number of players and the number of pieces can be independently chosen. We also prove multilabeled versions of Fan’s lemma, a combinatorial analogue of the Borsuk-Ulam theorem, and ...