Search
Now showing items 1-4 of 4
An empirical investigation into randomly generated euclidean symmetric traveling salesman problems
(2010-07-22)
The traveling salesman problem is one of the most well-solved hard combinatorial optimization problems. Any new algorithm or heuristic for the traveling salesman problem is empirically evaluated based on its performance ...
Computing the Probability Mass Function of the Maximum Flow through a Reliable Network
(2011-05-26)
This paper proposes a fast state-space enumeration based algorithm called TOP-DOWN capable of computing the probability mass function of the maximum s-t flow through reliable networks. The algorithm computes the probability ...
Evaluating Downside Risks in Reliable Networks
(2011-05-27)
Reliable networks are those in which network elements have a positive probability of failing. Conventional performance measures for such networks concern themselves either with expected network performance or with the ...
Speeding Up the Estimation of Expected Maximum Flows through Reliable Networks
(2011-05-27)
This paper presents a strategy for speeding up the estimation of expected maximum flows through reliable networks. Computational experiments with the strategy on three types of randomly generated networks show that it ...