Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: networks: path
Found
387 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Efficient path and vertex exchange in Steiner tree algorithms
1997,
Duin Cees
Steiner's problem in a weighted graph requires a tree of minimum total weight spanning...
Exact solution of multicommodity flow problems with branch-and-bound and column generation
2001,
Carvalho J.M. Valrio de
We present a branch-and-price algorithm to solve the minimum cost multicommodity flow...
Package routing in transportation networks with fixed vehicle schedules
1996,
Dean Thomas J.
We consider a special case of the general problem involving the routing of packages...
A new method of fast fault grading
1997,
Deniziak Stanisaw
A new algorithm of fast fault grading for combinational circuits, based on critical...
On shortest path games
2000,
Garca-Jurado I.
A class of cooperative TU-games arising from shortest path problems is introduced and...
Graph indexing for spatial data traversal in road map databases
2001,
Zhao J. Leon
This paper proposes a graph indexing technique for processing constrained spatial...
A predictive dynamic traffic assignment model in congested capacity-constrained road networks
2000,
Wong S.C.
In this paper, a predictive dynamic traffic assignment model in congested...
Recognizing k-path graphs
2000,
Prisner Erich
The k -path graph P k ( H ) of a graph H has all length- k paths of H as vertices; two...
Optimal stochastic scheduling of a two-stage tandem queue with parallel servers
1999,
Duenyas Izak
We consider the optimal stochastic scheduling of a two-stage tandem queue with two...
Linear stochastic fluid networks
1999,
Whitt Ward
We introduce open stochastic fluid networks that can be regarded as continuous...
Stability of a three-station fluid network
1999,
Dai J.G.
This paper studies the stability of a three-station fluid network. We show that,...
On–off fluid models in heavy traffic environment
1999,
Debicki Krzysztof
We consider fluid models with infinite buffer size. The net input rate to the buffer...
On the correlation of sojourn times in open networks of exponential multiserver queues
2000,
Daduna Hans
We consider the joint distribution of successive sojourn times of customers traversing...
A sufficient condition and a necessary condition for the diffusion approximations of multiclass queueing networks under priority service disciplines
2000,
Chen Hong
We establish a sufficient condition for the existence of the (conventional) diffusion...
A large closed queueing network with autonomous service and bottleneck
2000,
Abramov Vyacheslav M.
This paper studies the queue-length process in a closed Jackson-type queueing network...
Stability and instability of routings through a queueing network
2000,
Scheutzow Michael
We consider a network of N nodes with given distances in which customers arrive at one...
Overflow and losses in a network queue with a self-similar input
2000,
Tsybakov Boris
This paper considers a discrete time queueing system that models a communication...
Fluid approximation of a controlled multiclass tandem network
2000,
Hordijk A.
A two-station, four-class queueing network with dynamic scheduling of servers is...
An analytical solution for a tandem queue with blocking
2000,
Grassmann Winfried K.
The model considered in this paper involves a tandem queue with two waiting lines, and...
A generalized optimum requirement spanning tree problem with a Monge-like property
2000,
Anazawa Tsutomu
We consider a generalized optimum requirement spanning tree problem (GORST problem)...
Search for minimal cuts in modified networks
2001,
Yeh Wei-Chang
In this paper, first we develop an intuitive algorithm using the shortest path based...
Heuristics for the stochastic/dynamic user-optimal route choice problem
2000,
Chen Huey-Kuo
A stochastic/dynamic user-optimal route choice problem that assumes time-dependent...
An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
2000,
Ziliaskopoulos Athanasios
In this paper, we present a time-dependent intermodal optimum path algorithm for...
A tabu search heuristic for the capacitated arc routing problem
2000,
Laporte Gilbert
The Capacitated Arc Routing Problem arises in several contexts where streets or roads...
First Page
8
9
10
11
12
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers