Keyword: networks: path

Found 387 papers in total
A second order stochastic network equilibrium model, II: Solution method and numerical experiments
A second order stochastic network equilibrium model, II: Solution method and numerical experiments
2002,
Real traffic networks typically exhibit considerable day-to-day variations in traffic...
A new algorithm for K shortest paths problem
A new algorithm for K shortest paths problem
2001,
This paper presents a new algorithm for the K Shortest Paths Problem which develops...
Port partitioning and dynamic queueing for internet protocol forwarding
Port partitioning and dynamic queueing for internet protocol forwarding
2002,
With the increase of internet protocol packets the performance of routers became an...
Organization of local post transportation routes
Organization of local post transportation routes
2001,
Every day many items of post are delivered from the local post office to the branch...
Locating stations on rapid transit lines
Locating stations on rapid transit lines
2002,
When the alignment of a new line or section of a line of a rapid transit system has...
Tabu search for a network loading problem with multiple facilities
Tabu search for a network loading problem with multiple facilities
2000,
This paper examines a network design problem that arises in the telecommunications...
Efficient modeling of travel in networks with time-varying link speeds
Efficient modeling of travel in networks with time-varying link speeds
2000,
This paper investigates exact and approximate methods for estimating time-minimizing...
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
1998,
Given is an undirected graph with positive or negative edge weights which represent a...
From efficiency measurement to efficiency improvement: The choice of a relevant benchmark
From efficiency measurement to efficiency improvement: The choice of a relevant benchmark
2001,
This article deals with efficiency improvement and how to identify appropriate...
Using a hybrid of exact and genetic algorithms to design survivable networks
Using a hybrid of exact and genetic algorithms to design survivable networks
2002,
Wide-band technology has the capability to carry many services such as voice, video...
A polynomial algorithm for the p-centdian problem on a tree
A polynomial algorithm for the p-centdian problem on a tree
1998,
The most common problems studied in network location theory are the p -median and the...
On a standard time transportation problem
On a standard time transportation problem
2001,
This paper studies a standard time transportation problem. Parallel transportation is...
Transmissions in a network with capacities and delays
Transmissions in a network with capacities and delays
1999,
We examine the problem of transmitting in minimum time a given amount of data between...
All-to-all communication for some wavelength-routed all-optical networks
All-to-all communication for some wavelength-routed all-optical networks
1999,
This paper studies the problem of all-to-all communication for optical networks. In...
Lower bounds for linear interval routing
Lower bounds for linear interval routing
1999,
Linear interval routing is a space-efficient routing method for point-to-point...
Deadlock-free interval routing schemes
Deadlock-free interval routing schemes
1999,
k -Interval labeling schemes ( k -ILS) are compact routing schemes on general networks...
Greedy online algorithms for routing permanent virtual circuits
Greedy online algorithms for routing permanent virtual circuits
1999,
We analyze the competitive ratio of two greedy online algorithms for routing permanent...
A simple efficient approximation scheme for the restricted shortest path problem
A simple efficient approximation scheme for the restricted shortest path problem
2001,
In this paper we give a very simple fully polynomial approximation scheme for the...
A genetic algorithm for searching shortest path in public transportation network
A genetic algorithm for searching shortest path in public transportation network
2001,
The common shortest path problem is to find the shortest route between two specified...
Shortest paths in almost acyclic graphs
Shortest paths in almost acyclic graphs
2000,
This paper presents an algorithm for the shortest-path problem on a directed graph...
Norton's theorem for batch routing queueing networks
Norton's theorem for batch routing queueing networks
2001,
This paper shows that the aggregation and decomposition results known as Norton's...
A note on distributed multicast routing in point-to-point networks
A note on distributed multicast routing in point-to-point networks
2001,
The distributed algorithm for a multicast connection set-up, based on the...
A tabu search algorithm for the site dependent vehicle routing problem with time windows
A tabu search algorithm for the site dependent vehicle routing problem with time windows
2001,
This paper shows that the Site Dependent Vehicle Routing Problem (SDVRP) can be viewed...
Location-arc routing problems
Location-arc routing problems
2001,
Location-Arc Routing Problems (LARPs) are encountered in contexts where it is...
Papers per page: