2343 search results - page 59 / 469 » The Locomotive Routing Problem |
117
Voted
CP
1997
Springer
15 years 8 months ago
1997
Springer
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...
116
click to vote
STOC
1993
ACM
15 years 8 months ago
1993
ACM
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...
151
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— 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...
122
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
—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...
128
Voted
QOFIS
2000
Springer
15 years 8 months ago
2000
Springer
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...