The Shortest Path Problem with Forbidden Paths (SPPFP) is a variant of the original shortest path problem, where the constraints come from a set of forbidden arc sequences that cannot be part of any feasible solution. ...

An important aspect of exploratory search over graph data is to understand what paths connect a given pair of nodes. Since the resulting paths can be manifold, various works propose ranking paths likely to be of interest ...

In the process of generating image based subject specific musculoskeletal models and the simulation of rescaled generic musculoskeletal models, the accurate segmentation of the anatomical structures of interest from medical ...

This work introduces the problem of the best choice among M combinations of the shortest paths for dynamic provisioning of lightpaths in all-optical networks. To solve this problem in an optimized way (shortest path and ...

In this paper we consider a game theory approach for representing a real-world attacker–defender Stackelberg security game. In this novel approach the behavior of an ergodic system (repeated stochastic Markov chain game) ...

In this paper we study the Time-Dependent Elementary Shortest Path Problem with Resource Constraints (TDESPPRC). We consider two integer programming formulations which exploit the characteristics of the time-dependent ...