Results 61 to 70 of about 1,116,280 (113)
When the Path Is Never Shortest: A Reality Check on Shortest Path Biocomputation [PDF]
, 2018 To appear in: Adamatzky, A (Ed.) Shortest path solvers. From software to wetware.
openaire +2 more sources
Finding the K shortest hyperpaths using reoptimization [PDF]
The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen ...
Andersen, Kim Allan +2 more
core
Inverse Shortest Path Problems
openIn questa tesi vengono affrontati due classici problemi di ottimizzazione inversa: l'Inverse Shortest Path Problem (ISPP) e l'Inverse Shortest Path Length Problem (ISPL). Dopo alcuni richiami al contesto del problema, cioè la teoria dei grafi, segue
CASARIN, ALESSANDRO
core
Tightest Admissible Shortest Path [PDF]
The shortest path problem in graphs is fundamental to AI. Nearly all variants of the problem and relevant algorithms that solve them ignore edge-weight computation time and its common relation to weight uncertainty. This implies that taking these factors
Kaminka, Gal A. +2 more
core +2 more sources
Bicriterion a priori route choice in stochastic time-dependent networks. [PDF]
In recent years there has been a growing interest in using stochastic time-dependent (STD) networks as a modelling tool for a number of applications within such areas as transportation and telecommunications.
Andersen, Kim Allan +2 more
core
Comparison Studies for Different Shortest path Algorithms
, 2015 While technological revolution has active role to the increase of computer information, growing computational capabilities of devices, and raise the level of knowledge abilities, and skills. Increase developments in science and technology.
Abdelfatah Aref Tamimi
core +1 more source
Comparison of Interval Valued Pareto-Optimal Alternatives [PDF]
, 2016 Everyday tradeoff decisions are made where criteria must be compared, evaluated, and decided upon. In real world applications, variables have an inherent amount of uncertainty that must be regarded when making a decision, especially when ...
Stewart, Andrew
core
Precedence‐Constrained Shortest Path
NetworksABSTRACTWe propose a variant of the shortest path problem where the order in which vertices occur in the path is subject to precedence constraints. Precedence constraints are defined in terms of vertex pairs which indicate that a vertex is the predecessor of a vertex .
Christina Büsing +2 more
openaire +3 more sources
Convexities related to path properties on graphs; a unified approach [PDF]
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph. The general notion of path property, introduced in this paper, gives rise to a comprehensive survey of results obtained by different authors for a ...
Changat, M., Sierksma, G., Mulder, H.M.
core
True Costs of Cheap Labor Are Hard To Measure: Edge Deletion and VCG Payments in Graphs
, 2004 We address the problem of lowering the buyer's expected payments in shortest path auctions, where the buyer's goal is to purchase a path in a graph in which edges are owned by selfish agents.
Edith Elkind, Elkind, Edith
core