Keyword: networks: path

Found 387 papers in total
Traffic flows and product form solutions in stochastic transfer networks
Traffic flows and product form solutions in stochastic transfer networks
2000,
This paper focuses on product form and related tractable stationary distributions in a...
Explicit solutions for variational problems in the quadrant
Explicit solutions for variational problems in the quadrant
2001,
We study a variational problem (VP) that is related to semimartingale reflecting...
Expansions for joint Laplace transform of stationary waiting times in (max, +)-linear systems with Poisson input
Expansions for joint Laplace transform of stationary waiting times in (max, +)-linear systems with Poisson input
2001,
We give a Taylor series expansion for the joint Laplace transform of stationary...
Network of single-server queues with dependent service times
Network of single-server queues with dependent service times
2001,
A network of single-server nodes fed by customers of several classes is considered....
A load-balanced network with two servers
A load-balanced network with two servers
2001,
A load-balanced network with two queues Q 1 and Q 2 is considered. Each queue receives...
Some results for large closed queueing networks with and without bottleneck: Up- and down-crossings approach
Some results for large closed queueing networks with and without bottleneck: Up- and down-crossings approach
2001,
The paper provides the up- and down-crossing method to study the asymptotic behavior...
Conservation laws for single-server fluid networks
Conservation laws for single-server fluid networks
2001,
We consider single-server fluid networks with feedback and arbitrary input processes....
On the existence of invariant measures for networks with string transitions
On the existence of invariant measures for networks with string transitions
2001,
Recently a new class of Markov network processes was introduced, characterized by...
Stability of fluid networks with proportional routing
Stability of fluid networks with proportional routing
2001,
In this paper we investigate the stability of a class of two-station multiclass fluid...
Stability of earliest-due-date, first-served queueing networks
Stability of earliest-due-date, first-served queueing networks
2001,
We study multiclass queueing networks with the earliest-due-date, first-served (EDDFS)...
Dynamics of large uncontrolled loss networks
Dynamics of large uncontrolled loss networks
2000,
This paper studies the connection between the dynamical and equilibrium behaviour of...
A composite very large-scale neighbourhood structure for the capacitated minimum spanning tree problem
A composite very large-scale neighbourhood structure for the capacitated minimum spanning tree problem
2003,
The capacitated minimum spanning tree (CMST) problem is to find a minimum cost...
Project scheduling in AND-OR graphs: A generalization of Dijkstra's algorithm
Project scheduling in AND-OR graphs: A generalization of Dijkstra's algorithm
2002,
The paper considers a project scheduling problem in weighted directed graphs in which...
Dynamics of global supply chain supernetworks
Dynamics of global supply chain supernetworks
2003,
In this paper, we develop a framework for the modelling, analysis, and computation of...
On the undirected rural postman problem: Tight bounds based on a new formulation
On the undirected rural postman problem: Tight bounds based on a new formulation
2003,
The Rural Postman Problem (RPP) is a classic ‘edge-routing’ problem. A...
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
2002,
This paper investigates minimum time and minimum cost path problems in street networks...
Swapping a failing edge of a single source shortest paths tree is good and fast
Swapping a failing edge of a single source shortest paths tree is good and fast
2003,
Let G = (V, E) be a 2-edge connected, undirected and nonnegatively weighted graph, and...
A note on the traveling repairman problem
A note on the traveling repairman problem
2002,
Given a finite set of N nodes and the time required for traveling among nodes, in the...
Makespan minimization in projects with threshold activities
Makespan minimization in projects with threshold activities
2002,
The problem of minimizing the duration of a project is studied in situations involving...
Compact routing in chordal grids and other networks
Compact routing in chordal grids and other networks
2002,
Static routing based on routing tables is often used in distributed systems. Such a...
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
2003,
From the point of view of quality management, it is an important issue to reduce the...
Capacity reliability of a road network: An assessment methodology and numerical results
Capacity reliability of a road network: An assessment methodology and numerical results
2002,
Existing reliability studies of road networks are mainly limited to connectivity and...
Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues
Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues
2002,
This paper considers a simultaneous route and departure time choice equilibrium...
The capacitated general routing problem on mixed graphs
The capacitated general routing problem on mixed graphs
2002,
The Capacitated General Routing Problem (CGRP) on mixed graphs is one of the more...
Papers per page: