The Steiner Team Orienteering Problem (STOP) is defined on a digraph in which arcs are associated with traverse times, and whose vertices labeled as either mandatory or profitable, being the latter provided rewards (profits). Given homogeneous fleet of vehicles M, goal to find up m = |M| disjoint routes (from an origin vertex destination one) that maximize total sum collected while satisfying g...

This paper formulates a team orienteering problem with multiple fixed-wing drones and develops branch-and-price algorithm to solve the optimality. Fixed-wing drones, unlike rotary have kinematic constraints associated them, thereby preventing them make on-the-spot turns restricting minimum turn radius. presents implications of these on drone routing formulation proposes systematic technique add...

Introduction—Despite the growing popularity of oV-road running events, little information is available about the physiological stress of such activities. The demands of such events are unique in terms of the rough surface of the terrain encountered as well as the underfoot vegetation and the gradient. Objectives—The aim of this study was to investigate the physiological response of female athle...

Abstract In supersingular isogeny-based cryptography, the path-finding problem reduces to endomorphism ring problem. Can be reduced knowing just one endomorphism? It is known that a small degree enables polynomial-time and computation (in: Love Boneh, ANTS XIV-Proceedings of Fourteenth Algorithmic Number Theory Symposium, volume 4 Open Book Ser. Math. Sci. Publ., Berkeley, 2020). An gives an ex...

The problem of where a mobile robot should go to efficiently build a map of its surroundings is frequently addressed using entropy reduction techniques. However, in exploration problems where the goal is to find an object or objects of interest, such techniques can be a useful heuristic but are optimising the wrong quantity. An example of such a problem is an autonomous underwater vehicle (AUV)...

We address the problem of crowd congestion at venues liketheme parks, museums and world expos by providing routeguidance to multiple selfish users (with budget constraints)moving through the venue simultaneously. To representthese settings, we introduce the Selfish Orienteering Problem(SeOP) that combines two well studied problems from liter-ature, namely Orienteering Pr...

BACKGROUND Despite the substantial number of older adults suffering from gastrointestinal (GI) symptoms little is known regarding the character of these complaints and whether they are associated with an altered intestinal barrier function and psychological distress. Our aim was to explore the relationship between self-reported gut health, intestinal permeability and psychological distress amon...

We consider several Vehicle Routing Problems (VRP) with profits, which seek to select a subset of customers, each one being associated with a profit, and to design service itineraries. When the sum of profits is maximized under distance constraints, the problem is usually called team orienteering problem. The capacitated profitable tour problem seeks to maximize profits minus travel costs under...