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
An algorithm for optimising the servicing of products with constrained, multiple defects
2000,
Lye S.W.
The twin pillars of sustainable development are the conservation of natural resources...
Stochastic shortest path games
1999,
Bertsekas D.P.
We consider dynamic, two-player, zero-sum games where the ‘minimizing’...
Probabilistic analysis of 2-opt for travelling salesman problems
1998,
Fukushima M.
In this paper, we propose a probabilistic model of 2-opt heuristics and study its...
An efficient transformation of the generalized vehicle routing problem
2000,
Improta Gennaro
The Generalized Vehicle Routing Problem (GVRP) is the problem of designing optimal...
Time–cost evaluation of alternative system/process designs
1999,
Shaftel Timothy L.
Techniques for representing system/process designs are a common feature of most design...
Weight of shortest path analyses for the optimal location problem
2000,
Oyama Tatsuo
In this paper we consider the shortest path counting problem ( SPCP ): how many...
Constructal theory of economics structure generation in space and time
2000,
Bejan A.
This paper extends to economics the constructal theory of generation of shape and...
Heuristics for the k-cardinality tree and subgraph problems
1997,
Hamacher Horst W.
In this paper we consider the problem of finding in a given graph a minimal weight...
Tabu search for weighted k-cardinality trees
1997,
Jrnsten Kurt
We consider the minimum weighted k -cardinality tree problem, i.e. the problem of...
Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies
1999,
Maglaras Constantinos
This paper describes a family of discrete-review policies for scheduling open...
Bottleneck analysis in multiclass closed queueing networks and its application
1999,
Kogan Yaakov
Asymptotic behaviour of queues is studied for large closed multi-class queueing...
Queue length and occupancy in discrete-time cyclic networks with several types of nodes
1999,
Pestien Victor
For a discrete-time, closed, cyclic queueing network, where the nodes have...
Moderate deviations for queues in critical loading
1999,
Puhalskii Anatolii A.
We establish logarithmic asymptotics of moderate deviations for queue-length and...
A heavy traffic limit theorem for a class of open queueing networks with finite buffers
1999,
Dai J.G.
We consider a queueing network of d single server stations. Each station has a finite...
Approximations of open queueing networks by reflection mappings
1999,
Sakhanenko Alexander I.
This paper presents a three-step procedure which allows to approximate the...
Value iteration and optimization of multiclass queueing networks
1999,
Chen Rong-Rong
This paper considers in parallel the scheduling problem for multiclass queueing...
Ergodicity of a polling network with an infinite number of stations
1999,
Borovkov Alexandr A.
A Markov polling system with infinitely many stations is studied. The topic is the...
Window flow control in FIFO networks with cross traffic
1999,
Baccelli F.
We focus on window flow control as used in packet-switched communication networks. The...
Overflow and loss probabilities in a finite ATM buffer fed by self-similar traffic
1999,
Tsybakov Boris
Real-time measurements from LANs, variable-bit-rate video sources, ISDN...
Recurrence and transience properties of some neural networks: An approach via fluid limit models
1999,
Last G.
The subject of the paper is the stability analysis of some neural networks consisting...
A hybrid genetic algorithm for a Hamiltonian path problem
1999,
Len Eunice Ponce de
This paper deals with Hável and Erdös conjecture that asserts that all...
Semidefinite relaxations of the traveling salesman problem
1999,
Cvetkovi Drago
We apply semidefinite programming to the symmetric traveling salesman problem. The TSP...
Improved solutions for the Chinese postman problem on mixed networks
1999,
Pearn W.L.
The Chinese postman problem (CPP) is that of finding the shortest postman tour...
A new rank based version of the ant system – a computational study
1999,
Hartl Richard F.
The ant system is a new meta-heuristic for hard combinatorial problems. It is a...
First Page
9
10
11
12
13
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers