Add to ORKGThere 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.Comment: Accepted by J. of Combinatorics, 5/September/202
For vertices $u$ and $v$ of an $n$-vertex graph $G$, a $uv$-trail of $G$ is an induced $uv$-path of ...
International audienceThis article presents a method to find close-to-Pareto-optimal solutions for a...
Deǐneko and Woeginger (Oper. Res. Lett. 28 (2001) 169) present a proof that a result of Du and Hwang...
There are n travellers who have k bicycles and they wish to complete a journey in the shortest possi...
With the increasing popularity of cycling as a mode of transportation, there is a growing need for e...
In the context of recreational routing, the problem of finding a route which starts and ends in the ...
The cycle trip planning problem (CTPP) can be formulated as a variant of the arc orienteering proble...
We study parameterized versions of classical algorithms for computing shortest-path trees. This is m...
The Traveling Salesman Problem is a well known problem from computer science. We know that the sales...
Bicycles are becoming an increasingly popular mean of transport. Being healthy and affordable, they ...
We consider the following surveillance problem: Given a set P of n sites in a metric space and a set...
This article provides an overview to the Travelling Salesman Problem (TSP) and the relevant aspects ...
International audienceThis paper is motivated by operating self service transport systems that flour...
The ridesharing problem is to share personal vehicles by individuals (participants) with similar iti...
International audienceThis article tackles the multi-trip vehicle routing problem with time windows ...
For vertices $u$ and $v$ of an $n$-vertex graph $G$, a $uv$-trail of $G$ is an induced $uv$-path of ...
International audienceThis article presents a method to find close-to-Pareto-optimal solutions for a...
Deǐneko and Woeginger (Oper. Res. Lett. 28 (2001) 169) present a proof that a result of Du and Hwang...
There are n travellers who have k bicycles and they wish to complete a journey in the shortest possi...
With the increasing popularity of cycling as a mode of transportation, there is a growing need for e...
In the context of recreational routing, the problem of finding a route which starts and ends in the ...
The cycle trip planning problem (CTPP) can be formulated as a variant of the arc orienteering proble...
We study parameterized versions of classical algorithms for computing shortest-path trees. This is m...
The Traveling Salesman Problem is a well known problem from computer science. We know that the sales...
Bicycles are becoming an increasingly popular mean of transport. Being healthy and affordable, they ...
We consider the following surveillance problem: Given a set P of n sites in a metric space and a set...
This article provides an overview to the Travelling Salesman Problem (TSP) and the relevant aspects ...
International audienceThis paper is motivated by operating self service transport systems that flour...
The ridesharing problem is to share personal vehicles by individuals (participants) with similar iti...
International audienceThis article tackles the multi-trip vehicle routing problem with time windows ...
For vertices $u$ and $v$ of an $n$-vertex graph $G$, a $uv$-trail of $G$ is an induced $uv$-path of ...
International audienceThis article presents a method to find close-to-Pareto-optimal solutions for a...
Deǐneko and Woeginger (Oper. Res. Lett. 28 (2001) 169) present a proof that a result of Du and Hwang...