Publisher Summary Trees are particular types of graphs that on the surface appear to be
quite specialized, so much so that they might not seem to merit in-depth investigation. Tree …

Publisher Summary Network reliability encompasses a range of issues related to the design
and analysis of networks which are subject to the random failure of their components …

Numerous transportation applications as diverse as capital investment decision-making,
vehicle fleet planning, and traffic light signal setting all involve some form of (discrete choice) …

We give a survey up to 1989 on the Steiner tree problems which include the four important
cases of euclidean, rectilinear, graphic, phylogenetic and some of their generalizations. We …

The bottleneck of the state-of-the-art algorithms for geometric Steiner problems is usually the
concatenation phase, where the prevailing approach treats the generated full Steiner trees …

Given a mixed-integer programming problem with two matrix constraints, it is possible to
define a Lagrangean relaxation such that the relaxed problem decomposes additively into …

Comprehensively teaches the fundamentals of supply chain theory This book presents the
methodology and foundations of supply chain management and also demonstrates how …

We give the first approximation algorithm for the generalized network Steiner problem, a
problem in network design. An instance consists of a network with link-costs and} for each …

The problem of determining a minimum cost connected network (ie, weighted graph) G that
spans a given subset of vertices is known in the literature as the Steiner problem in …

This paper is intended as a survey in the area of network synthesis and optimum network
design, which, in view of the importance and variety of the underlying applications, has …