Sciweavers

2343 search results - page 105 / 469
» The Locomotive Routing Problem
Sort
View
ORL
2002
92views more  ORL 2002»
13 years 9 months ago
Efficient feasibility testing for dial-a-ride problems
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specif...
Brady Hunsaker, Martin W. P. Savelsbergh
CORR
2011
Springer
239views Education» more  CORR 2011»
13 years 1 months ago
Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
Imen Harbaoui Dridi, Ryan Kammarti, Pierre Borne, ...
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
14 years 4 months ago
Probe Matrix Problems: Totally Balanced Matrices
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
David B. Chandler, Jiong Guo, Ton Kloks, Rolf Nied...
DEXAW
2003
IEEE
99views Database» more  DEXAW 2003»
14 years 3 months ago
Handling Identity in Peer-to-Peer Systems
Due to the limited number of available IP addresses most computers on the Internet use dynamic IP addresses which causes problems for applications that have to maintain routing ta...
Manfred Hauswirth, Anwitaman Datta, Karl Aberer
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
14 years 2 days ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer