Numerous approaches have been proposed for path planning in dynamic current fields, for a fixed departure time. However, in many applications, the departure time is not necessarily...
Consider the following game. Given a network with a continuum of users at some origins, suppose that users wish to reach specic destinations, but that they are not indierent to the...
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
: We consider the routing and the wavelength assignment (RWA) of scheduled and random lightpath demands in a wavelength switching mesh network without wavelength conversion functio...
: Over time, large scale pickup and delivery providers acquire considerable amounts of data on customer orders, including order times, amount and configurations of freight, as well...