Page
%P
-
Article
Optimal location of multi-server congestible facilities operating as M/E r /m/N queues
Most models for location of immobile congested facilities assume exponentially distributed service time at the facilities. Although the resulting formulations are tractable, they do not adequately represent se...
-
Article
Efficient solution methods for covering tree problems
In recent years, interest has been shown in the optimal location of ‘extensive’ facilities in a network. Two such problems—the Maximal Direct and Indirect Covering Tree problems—were introduced by Hutson and R...
-
Article
Network reliability and the probabilistic estimation of damage from fire spread
An efficient generalization of Shanthikumar's upper bound on two-terminal reliability is developed, that leads to efficient methods for the probabilistic assessment of damage from fire spread and other invasiv...
-
Article
Linear Network Optimization: Algorithms and Codes
-
Article
Location of Facilities Producing Airborne Pollution
The location of a facility producing an airborne pollutant is considered and the 4-wind model introduced by Karkazis and Papadimitriou is described briefly. Ways in which the model may be enhanced are discusse...
-
Article
Location of Software in Distributed Computing Systems
The planning and design of computer networks give rise to many location problems. These may be split into those primarily concerned with placement of hardware and those with software. Here, a broad overview of...
-
Article
Location of Transfer Centres on Segments of a Communication Network with Proportional Traffic
The problem of placing bridges to alleviate congestion in a heavily loaded local-area computer network is briefly described. It is suggested that the generalization to that of placing transfer centres in other...
-
Article
Location Problems Arising in Computer Networks
The planning and organization of computer networks give rise to many location problems. These may be split into those primarily concerned with placement of hardware and those with software. Here a broad overvi...
-
Chapter
Probabilistic Risk Assessment Associated with Fire Spread in Segregated Structures
A segregated structure is regarded as a collection of volumes joined together by barriers. A fire, starting in one of the volumes, may spread through its bounding barriers to other volumes. The safety assessme...
-
Article
p-Medians and Multi-Medians
The classical p-median problem is discussed, together with methods for its solution. The multi-median problem, a generalization of the p-median problem in which more than one type of facility is allowed, is intro...
-
Article
Speeding up the Elzinga—Hearn Algorithm for Finding 1-Centres
It is shown how a simple but effective modification can speed up the well known Elzinga-Hearn algorithm for finding 1-centres in the plane.
-
Book
-
Chapter
Introduction
What is a graph? Consider first the commonly used concept defined in terms of Cartesian coordinates; figure 1.la shows a graph of a real valued function f of a real continuous variable x where <m...
-
Chapter
Branch-and-bound Methods
As pointed out in section 2.4, multi-decision problems are represented naturally by trees in which a node x represents the set of (component) decisions actually made, and the branches from x represent the poss...
-
Chapter
Flows in Networks: Basic Model
Many problems in OR are concerned with the flow of some ‘substance’ or ‘set of items’ through a network. For example, the flow of vehicles through a road system, trains through a railway network, messages thro...
-
Chapter
Network Flow: Extensions
The basic problem studied in chapter 9 was indeed very specialised and many features that might be expected in a real life situation were not accounted for. This chapter extends the basic theory in several dir...
-
Chapter
Location Problems
Situations in which a physical object, or objects, have to be located are of very frequent occurrence. The objects in question will be called facilities. A variety of factors have to be taken into account in loca...
-
Chapter
The Travelling Salesman and Chinese Postman Problems
A problem which has attracted much attention, and continues to do so, is the travelling salesman problem (TSP) in which a salesman starting from town T1 visits n —1 other towns T2, T3,..., Tn, each once only, fin...
-
Chapter
Some Basic Concepts
Graph theory suffers from a mass of definitions. The situation is made worse by different authors using different terminologies often resulting in a given word being used to convey more than one concept. It is...
-
Chapter
Shortest Route Problems
Shortest routes (paths or chains) are of fundamental importance in network and combinatorial optimisation problems, both in their own right and as sub-problems of other optimisation problems. Shortest route pr...
