Abstract
There are n travellers who have k bicycles and they wish to complete a journey in the shortest possible time. We investigate optimal solutions of this problem, showing they are characterized by a set of words in the Dyck language. Particular solutions with additional desirable properties are introduced and analysed.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.