Keyword: networks: path

Found 387 papers in total
A fluid queueing model for link travel time moments
A fluid queueing model for link travel time moments
2004,
We analyze the moments of the random time required for a vehicle to traverse a...
A branch and bound algorithm for the robust shortest path problem with interval data
A branch and bound algorithm for the robust shortest path problem with interval data
2004,
Many real problems can be modelled as robust shortest path problems on interval...
Random location of fuel treatments in wildland community interfaces: a percolation approach
Random location of fuel treatments in wildland community interfaces: a percolation approach
2004,
We explore the use of spatially correlated random treatments to reduce fuels in...
A mixed integer formulation for multiple-route transit network design
A mixed integer formulation for multiple-route transit network design
2003,
We consider the design of multiple transit lines in a network and present a mixed...
The 2-path network problem
The 2-path network problem
2004,
Given a graph with nonnegative edge weights and a set D of node pairs, the 2-path...
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
2004,
We propose a fully polynomial bicriteria approximation scheme for the constrained...
Analysis of a rollout approach to sequencing problems with stochastic routing applications
Analysis of a rollout approach to sequencing problems with stochastic routing applications
2003,
The paper considers sequencing problems, the traveling salesman problem being their...
Solving bicriteria 0–1 knapsack problems using a labeling algorithm
Solving bicriteria 0–1 knapsack problems using a labeling algorithm
2003,
This paper examines the performances of a new labeling algorithm to find all the...
Minimization of travel time and weighted number of stops in a traffic-light network
Minimization of travel time and weighted number of stops in a traffic-light network
2003,
The time-constrained shortest path problem is an important generalization of the...
Using software complexity measures to analyze algorithms – an experiment with the shortest-paths algorithms
Using software complexity measures to analyze algorithms – an experiment with the shortest-paths algorithms
2003,
In this paper, we apply different software complexity measures to a set of...
A heuristic algorithm for the mixed Chinese Postman Problem
A heuristic algorithm for the mixed Chinese Postman Problem
2002,
The Chinese Postman Problem (CPP) is to find a minimum-cost Eulerian tour in a given...
An interactive goal programming procedure for operational recovery problems
An interactive goal programming procedure for operational recovery problems
2002,
We propose an interactive Goal Programming (GP) for operational recovery problems that...
The absolute center of a network
The absolute center of a network
2004,
This paper presents a new algorithm for finding an absolute center (minimax criterion)...
An efficient heuristic for traffic grooming and light-path routing in wavelength division multiplexing ring networks with hop-count constraint
An efficient heuristic for traffic grooming and light-path routing in wavelength division multiplexing ring networks with hop-count constraint
2003,
This paper deals with a traffic grooming and light-path routing problem in WDM-ring...
Minimizing risk models in stochastic shortest path problems
Minimizing risk models in stochastic shortest path problems
2003,
We consider a minimizing risk model in a stochastic shortest path problem in which for...
Existence condition for the diffusion approximations of multiclass priority queueing networks
Existence condition for the diffusion approximations of multiclass priority queueing networks
2001,
In this paper, we extend the work of Chen and Zhang and establish a new sufficient...
Time-constrained Chinese postman problems
Time-constrained Chinese postman problems
2002,
The Chinese postman problem was first proposed by the Chinese mathematician Meigu...
A stochastic lower bound for assemble–transfer batch service queueing networks
A stochastic lower bound for assemble–transfer batch service queueing networks
2000,
Miyazawa and Taylor introduced a class of assemble–transfer batch service...
Assessing an intuitive condition for stability under a range of traffic conditions via a generalised Lu–Kumar network
Assessing an intuitive condition for stability under a range of traffic conditions via a generalised Lu–Kumar network
2000,
We argue the importance both of developing simple sufficient conditions for the...
Smoothing effect of the superposition of homogeneous sources in tandem networks
Smoothing effect of the superposition of homogeneous sources in tandem networks
2000,
We analyze the smoothing effect of superposing homogeneous sources in a network. We...
Applications of SMP bounds to multi-class traffic in high-speed networks
Applications of SMP bounds to multi-class traffic in high-speed networks
2000,
In this paper, we consider the stochastic fluid-flow model of a single node in a...
Single class queueing networks with discrete and fluid customers on the time interval ℝ
Single class queueing networks with discrete and fluid customers on the time interval ℝ
2000,
We discuss a model for general single class queueing networks which allows discrete...
Markov-modulated feedforward fluid networks
Markov-modulated feedforward fluid networks
2001,
With the aim of studying a multi-station feedforward fluid network with...
State-dependent coupling of quasireversible nodes
State-dependent coupling of quasireversible nodes
2001,
The seminal paper of Jackson began a chain of research on queueing networks with...
Papers per page: