نتایج جستجو برای: orienteering problem
تعداد نتایج: 880354 فیلتر نتایج به سال:
• Adaptable experimental design to solve the Tourist Trip Design Problem. Performance, generalization and inference times suitable for real-time applications. Sets ground incorporating real data in supervised training. Improvements Pointer Network model extendable similar combinatorial problems. include recursivity Transformer one-step lookahead mask. The Orienteering Problem with Time Windows ...
BACKGROUND The proportion of individuals reaching an old age is increasing and will, in the near future consume a majority of health care resources. It is therefore essential to facilitate the maintenance of optimal functionality among older adults. By characterizing older individuals experiencing wellbeing, factors important to promote and maintain health through life can be identified. Orient...
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T , find an s-t walk of total length at most T that maximizes the number of distinct nodes visited by the walk. One obtains a generalization, namely orienteering with time-windows (also referred to as TSP with time-windows), if each node v has a specified ti...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید