• No results found

[PDF] Top 20 The folk solution and Boruvka's algorithm in minimum cost spanning tree problems

Has 10000 "The folk solution and Boruvka's algorithm in minimum cost spanning tree problems" found on our website. Below are the top 20 most common "The folk solution and Boruvka's algorithm in minimum cost spanning tree problems".

The folk solution and Boruvka's algorithm in minimum cost spanning tree problems

The folk solution and Boruvka's algorithm in minimum cost spanning tree problems

... The folk solution and Boruvka’s algorithm in minimum cost spanning tree problems Bergantiños, Gustavo and Vidal-Puga, Juan Research Group in Economic Analisys, Universidade de Vigo.[r] ... See full document

23

The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources

The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources

... the folk rule for mcstp with multiple sources using four approaches: As the Shapley value of the irreducible game (Berganti˜ nos and Vidal-Puga (2007)), as an obligation rule (Tijs et ...the folk rule to ... See full document

24

Application Of Graph Theory To Find Optimal Path And Minimized Cost For The Transportation Problem

Application Of Graph Theory To Find Optimal Path And Minimized Cost For The Transportation Problem

... practical problems can be represented by ...finding minimum spanning tree and the shortest distance between two place using ...the minimum distance and the minimum cost of ... See full document

9

A Hybrid Algorithm Based on Memetic Algorithm and Tabu Search for -Minimum Spanning Tree Problems

A Hybrid Algorithm Based on Memetic Algorithm and Tabu Search for -Minimum Spanning Tree Problems

... Memetic Algorithm was first introduced by Moscato in 1989 ...Genetic Algorithm) have been applied widely to solve optimization problems because of their good search ...some problems which ... See full document

6

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources

... the minimum cost spanning tree, another interesting issue that usually arises is how to allocate that cost to the ...in minimum cost spanning tree ... See full document

33

Minimum Spanning Tree in Fuzzy Weighted Rough Graph

Minimum Spanning Tree in Fuzzy Weighted Rough Graph

... Abstract––The minimum spanning tree of a connected graph has many applications in different field of ...world problems the input data are often imprecise due to incomplete or non-obtainable ... See full document

6

Cost additive rules in minimum cost spanning tree problems with multiple sources

Cost additive rules in minimum cost spanning tree problems with multiple sources

... costly tree in the classical model, where there is a unique ...related problems that are difficult from a computational point of ...fixed cost spanning forest problem; Farley et al (2000) ... See full document

12

Characterization of the painting rule for multi source minimal cost spanning tree problems

Characterization of the painting rule for multi source minimal cost spanning tree problems

... the tree is obtained, the second issue is how to allocate the cost of such tree among the ...the folk rule following four definitions and present some axiomatic ... See full document

13

METAHEURISTIC APPROACHES FOR THE QUADRATIC MINIMUM SPANNING TREE PROBLEM

METAHEURISTIC APPROACHES FOR THE QUADRATIC MINIMUM SPANNING TREE PROBLEM

... optimization problems is based on the idea of applying evolution- ary principles to problem ...genetic algorithm. We have developed a GA to solve the QMSTP. In our algorithm, each individual of the ... See full document

12

A monotonic and merge proof rule in minimum cost spanning tree situations

A monotonic and merge proof rule in minimum cost spanning tree situations

... Aumann-Shapley cost sharing method, used to distribute the total generated cost that ensures that agents never find it profitable to split or to merge their ...several solution concepts by Hart ... See full document

31

MoL 2013 09: 
  The Iterative Minimum Cost Spanning Tree Problem

MoL 2013 09: The Iterative Minimum Cost Spanning Tree Problem

... the cost (it just divides the total cost of the constructed network over the agents), this is a bit ...the folk solution is one of the few charge rules who satisfies these ...connection ... See full document

117

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources

... (the cost allocation should depend only on the arcs that belong to the minimal tree), cone-wise additivity (the cost allocation should be additive on cones), symmetry (agents with the same connection ... See full document

39

Reliability Evaluation of the Minimum Spanning Tree on Uncertain Graph

Reliability Evaluation of the Minimum Spanning Tree on Uncertain Graph

... fundamental algorithm, called FERM (Fundamental algorithm of Evaluating the Reliability of MST), and an improved algorithm (IERM) to evaluating the reliability of the ...improved algorithm ... See full document

12

An efficient delay-constrained minimum spanning tree heuristic

An efficient delay-constrained minimum spanning tree heuristic

... delay-constrained minimum Steiner tree heuristics, can be used to construct delay-constrained broadcast trees, but most of them are too complicated ...delay-constrained minimum Steiner tree ... See full document

16

Prims Algorithm for Optimizing Fiber Optic Trajectory Planning

Prims Algorithm for Optimizing Fiber Optic Trajectory Planning

... Prim's algorithm performs searches on notes that have the shortest ...this algorithm has an important role to play in reducing construction ...the minimum spanning ...this algorithm ... See full document

6

Simulate High Traffic and Effective Cost an Academic Kurdistan Network Based on DWDM using OPNET

Simulate High Traffic and Effective Cost an Academic Kurdistan Network Based on DWDM using OPNET

... Figure 1. shows the start with one of the realistic locations, say Erbil university campus, try to find location that can be connected to it most cheaply, in this example it is Koya university campus. Then find the new ... See full document

14

Improving the Efficiency of Fast Using Semantic Similarity Algorithm

Improving the Efficiency of Fast Using Semantic Similarity Algorithm

... II. BACKGROUND AND RELATED WORK Feature subset selection is a process of discovering and eliminating as many irrelevant and redundant features as much as possible. Reason for this is 1) irrelevant features do not ... See full document

5

To Find Energy Efficient Protocol by using Minimum Spanning Tree

To Find Energy Efficient Protocol by using Minimum Spanning Tree

... Remote Sensor Networks (WSN) alludes to a gathering of moment, low power-driven sensor hubs that are spatially circulated to check the various environmental conditions. These sensor nodes are lightweight in nature, have ... See full document

6

Comovements in Government Bond Markets: A Minimum Spanning Tree Analysis

Comovements in Government Bond Markets: A Minimum Spanning Tree Analysis

... a minimum spanning tree (MST) is used to study patterns of comovements for a set of twenty government bond market indices for developed North American, European, and Asian ...hierarchical tree ... See full document

29

A spanning tree construction algorithm for industrial wireless sensor networks based on quantum artificial bee colony

A spanning tree construction algorithm for industrial wireless sensor networks based on quantum artificial bee colony

... node cost, no wiring, and relatively easy maintenance, IWSN has been fa- vored by more and more companies ...find problems in a timely manner, issue control commands, and reduce safety problems in ... See full document

12

Show all 10000 documents...