2343 search results - page 138 / 469 » The Locomotive Routing Problem |
148
click to vote
GLOBECOM
2006
IEEE
16 years 4 days ago
2006
IEEE
— We consider the path-determination problem in Internet core routers that distribute flows across alternate paths leading to the same destination. We assume that the remainder ...
151
click to vote
ICPPW
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
163
click to vote
COMPGEOM
2008
ACM
15 years 7 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
191
click to vote
ENTCS
2007
15 years 5 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
178
Voted
SODA
2010
ACM
16 years 3 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...