Sciweavers

2343 search results - page 59 / 469
» The Locomotive Routing Problem
Sort
View
CP
1997
Springer
13 years 12 months ago
GENIUS-CP: a Generic Single-Vehicle Routing Algorithm
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
13 years 11 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
INFOCOM
2007
IEEE
14 years 2 months ago
Neighborhood Watch for Internet Routing: Can We Improve the Robustness of Internet Routing Today?
— Protecting BGP routing from errors and malice is one of the next big challenges for Internet routing. Several approaches have been proposed that attempt to capture and block ro...
Georgos Siganos, Michalis Faloutsos
ICC
2007
IEEE
130views Communications» more  ICC 2007»
14 years 2 months ago
Off-network Control for Scalable Routing in Very Large Sensor Networks
—This paper presents an architectural solution to address the problem of scalable routing in very large sensor networks. The control complexities of the existing sensor routing p...
Tao Wu, Subir K. Biswas
QOFIS
2000
Springer
13 years 11 months ago
Mechanisms for Inter-domain QoS Routing in Differentiated Service Networks
In order to provide various services with different quality requirements, the current Internet is expected to turn into a QoS based Internet under the Differentiated Service (DiffS...
Peng Zhang, Raimo Kantola