Results 1  10
of
4,732
The robust minimum spanning tree problem
, 2003
"... We consider the robust minimum spanning tree problem where edges costs are on a compact subset of a cartesian product of intervals.Considering that the evaluating function is the sum of edge costs or the weighted sum, we show that to nd absolute robust, robust deviation and relative robust solutions ..."
Abstract
 Add to MetaCart
We consider the robust minimum spanning tree problem where edges costs are on a compact subset of a cartesian product of intervals.Considering that the evaluating function is the sum of edge costs or the weighted sum, we show that to nd absolute robust, robust deviation and relative robust
The probabilistic minimum spanning tree problem
 Networks
, 1990
"... In this paper we consider a natural probabilistic variation of the classical minimum spanning tree problem (MST), which we call the probabilistic minimum spanning tree problem (PMST). In particular, we consider the case where not all the points are deterministically present, but are present with cer ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
In this paper we consider a natural probabilistic variation of the classical minimum spanning tree problem (MST), which we call the probabilistic minimum spanning tree problem (PMST). In particular, we consider the case where not all the points are deterministically present, but are present
On the euclidean minimum spanning tree problem
 Computing Letters
"... Given a weighted graph G(V,E), a minimum spanning tree for G can be obtained in linear time using a randomized algorithm or nearly linear time using a deterministic algorithm. Given n points in the plane, we can construct a graph with these points as nodes and an edge between every pair of nodes. Th ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
. The weight on any edge is the Euclidean distance between the two points. Finding a minimum spanning tree for this graph is known as the Euclidean minimum spanning tree problem (EMSTP). The minimum spanning tree algorithms alluded to before will run in time O(n2) (or nearly O(n2)) on this graph. In this note
Heuristic Algorithms For Generalized Minimum Spanning Tree Problem
 INTERNATIONAL CONFERENCE OF MATHEMATICS AND INFORMATICS ICTAMI
, 2004
"... We consider a generalization of the classical minimum spanning tree problem called the generalized minimum spanning tree problem and denoted by GMST problem. The aim of this paper is to present an exact exponential time algorithm for the GMST problem as well three heuristic algorithms, two of them ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
We consider a generalization of the classical minimum spanning tree problem called the generalized minimum spanning tree problem and denoted by GMST problem. The aim of this paper is to present an exact exponential time algorithm for the GMST problem as well three heuristic algorithms, two
Polyhedral Analysis of the Generalized Minimum Spanning Tree Problem
 UNIVERSIT'E LIBRE DE BRUXELLES, CP 210/01, B1050 BRUXELLES, BELGIQUE
, 2000
"... The Generalized Minimum Spanning Tree Problem (GMSTP) is a variant of the classical Minimum Spanning Tree Problem, in which the vertices are partitionned into clusters and the tree has to include exactly one vertex from each cluster. A new integer linear formulation is presented for the problem and ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The Generalized Minimum Spanning Tree Problem (GMSTP) is a variant of the classical Minimum Spanning Tree Problem, in which the vertices are partitionned into clusters and the tree has to include exactly one vertex from each cluster. A new integer linear formulation is presented for the problem
Stochastic Inverse Minimum Spanning Tree Problem†
"... An inverse minimum spanning tree problem is to make the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the stochastic inverse minimum spanning tree problem is investigated. The concept of ..."
Abstract
 Add to MetaCart
An inverse minimum spanning tree problem is to make the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the stochastic inverse minimum spanning tree problem is investigated. The concept
Minimum Spanning Tree Problem with Interval Data
 Operations Research Letters
, 1999
"... In this paper, we investigate the minimum spanning tree problem where edge costs are interval numbers. Since minimum spanning trees depend on the realization of the edge costs, we de ne new optimality concepts to aid decision making. We present characterizations for these \optimal" solution ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In this paper, we investigate the minimum spanning tree problem where edge costs are interval numbers. Since minimum spanning trees depend on the realization of the edge costs, we de ne new optimality concepts to aid decision making. We present characterizations for these \optimal
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
"... Given an undirected graph with two different nonnegative costs associated with every edge e (say, we for the weight and le for the length of edge e) and a budget L, consider the problem of finding a spanning tree of total edge length at most L and minimum total weight under this restriction. This co ..."
Abstract

Cited by 44 (5 self)
 Add to MetaCart
Given an undirected graph with two different nonnegative costs associated with every edge e (say, we for the weight and le for the length of edge e) and a budget L, consider the problem of finding a spanning tree of total edge length at most L and minimum total weight under this restriction
Wisdom of the Crowds in Minimum Spanning Tree Problems
"... The „wisdom of the crowds ‟ effect describes the finding that combining responses across a number of individuals in a group leads to aggregate performance that is as good as or better than the performance of the best individuals in the group. Here, we look at the wisdom of the crowds effect in the M ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
in the Minimum Spanning Tree Problem (MSTP). The MSTP is an optimization problem where observers must connect a set of nodes into a network with the shortest path length possible. A method is developed that creates aggregate solutions based only on the nodes connected in individuals ‟ solutions, without access
Results 1  10
of
4,732