Sciweavers

2343 search results - page 23 / 469
» The Locomotive Routing Problem
Sort
View
SIROCCO
2004
13 years 9 months ago
Existence of Nash Equilibria in Selfish Routing Problems
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
Alessandro Ferrante, Mimmo Parente
TON
2008
99views more  TON 2008»
13 years 7 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
PACT
2005
Springer
14 years 1 months ago
Minimizing Hotspot Delay by Fully Utilizing the Link Bandwidth on 2D Mesh with Virtual Cut-Through Switching
Abstract. The hotspot seriously degrades the performance of a parallel algorithm but there have not been many methods proposed for this problem. Without modification of mesh topolo...
MinHwan Ok, Myong-Soon Park
CIMCA
2005
IEEE
14 years 1 months ago
A GRASP with Adaptive Memory for a Period Vehicle Routing Problem
We present some proposals to approximately solve a period vehicle routing problem used to model the extraction of oil from a set of onshore oil wells in Brazil. This problem diffe...
Luciana B. Goncalves, Luiz Satoru Ochi, Simone L. ...
NETWORKS
2007
13 years 7 months ago
Metaheuristics for the vehicle routing problem with loading constraints
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
Karl F. Doerner, Guenther Fuellerer, Richard F. Ha...