Results 221 to 230 of about 47,764 (259)

The fuzzy shortest path length and the corresponding shortest path in a network

Computers & Operations Research, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tzung-Nan Chuang, Jung-Yuan Kung
openaire   +2 more sources

The Shortest-Network Problem

Scientific American, 1989
The Steiner problem asks for the shortest network of line segments that will interconnect a set of given points. The Steiner problem cannot be solved by simply drawing lines between the given points, but it can be solved by adding new ones, called Steiner points, that serve as junctions in a shortest network.
Marshall W. Bern, Ronald L. Graham
openaire   +1 more source

Shortest Networks for Smooth Curves

SIAM Journal on Optimization, 1997
Summary: We set up a new model of shortest networks that interconnects a set of smooth curves and avoids a set of smoothly bounded obstacles. Using the hexagonal coordinate system we show how the problem of determining a full Steiner tree with a given topology in such a network can be converted to a problem of solving a set of simultaneous equations ...
openaire   +2 more sources

A Decomposition Algorithm for Shortest Paths in a Network

Operations Research, 1968
Given an n-node network with lengths associated with arcs: the problem is to find the shortest paths between every pair of nodes in the network. If the network has less than n(n − 1) arcs, then it is possible to treat parts of the network at a time and then get the shortest paths between every pair of nodes.
openaire   +2 more sources

On the Shortest Route Through a Network

Management Science, 1960
The chief feature of the method is that it fans out from the origin working out the shortest path to one new node from the origin and never having to backtrack. No more than n(n − 1)/2 comparisons are needed to find the shortest route from a given origin to all other nodes and possibly less between two fixed nodes.
openaire   +1 more source

On the existence of shortest networks in banach spaces

Mathematical Notes, 2013
For a Banach space contractively complemented in its bidual, a compactness argument is used to show that every finite set therein admits a Steiner point, i.e., a point which minimizes the sum of distances to members of the set. It has long been known that there is a Banach space (in fact, a hyperplane in a space of continuous functions) containing a 3 ...
Bednov, B. B., Strelkova, N. P.
openaire   +1 more source

Stability of join-the-shortest-queue networks

Queueing Systems, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian Gang Dai 0001, John J. Hasenbein, Bara Kim   +2 more
openaire   +2 more sources

Bicriteria shortest path in networks of queues

Applied Mathematics and Computation, 2006
The paper develops a polynomial algorithm to find the shortest path from the source to the sink node of a network of queues in the steady state. It is assumed that some nodes of the network contain service stations including either one or infinite servers with general distribution of service time.
openaire   +2 more sources

A shortest path network security model

Computers & Security, 1993
This paper presents a new model, based on the resource- constrained shortest path, for evaluating the security of computer networks. The power of the model is twofold. First, the use of the resource-constrained shortest path as an integral part of the model ties security evaluation metrics to graph theory, thus providing a rigorous mathematical base ...
John A. Fitch III, Lance J. Hoffman
openaire   +1 more source

Intuitionistic fuzzy shortest hyperpath in a network

Information Processing Letters, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parvathi Rangasamy, Muhammad Akram 0001, S. Thilagavathi   +2 more
openaire   +1 more source