866 search results - page 50 / 174 » On Dynamic Shortest Paths Problems |
EOR
2006
13 years 7 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
BIOWIRE
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a biologically inspired routing protocol called Self Selective Routing with preferred path selection (SSR(v3)). Its operation resembles the behavior of a biolog...
JGAA
2010
13 years 6 months ago
2010
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
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...
IWDC
2005
Springer
14 years 1 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...