Sciweavers

83 search results - page 2 / 17
» Arc routing problems with time-dependent service costs
Sort
View
ARC
2006
Springer
115views Hardware» more  ARC 2006»
13 years 9 months ago
Providing QoS Guarantees in a NoC by Virtual Channel Reservation
Abstract. Virtual channel reservation is a simple approach for providing guaranteed throughput services in a virtual channel network-on-chip. However, its performance is limited by...
Nikolay Kavaldjiev, Gerard J. M. Smit, Pascal T. W...
COR
2010
152views more  COR 2010»
13 years 5 months ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
ICOIN
2001
Springer
13 years 9 months ago
Performance Analysis of QoS Routing with Network Dependant Delay Cost
This paper investigates the problem of path calcul ation of multiple metric routing. Toda ’s Internet routing is based on a single metric path selecting algorithm. Single metric...
Hahnearl Jeon, Sung-Dae Kim, Young Joon Kim, Hyung...
ESA
2007
Springer
130views Algorithms» more  ESA 2007»
13 years 11 months ago
Convex Combinations of Single Source Unsplittable Flows
In the single source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given digraph. The deman...
Maren Martens, Fernanda Salazar, Martin Skutella
EOR
2007
69views more  EOR 2007»
13 years 5 months ago
Incorporating inventory and routing costs in strategic location models
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...
Zuo-Jun Max Shen, Lian Qi