This paper considers the general capacity expansion path problem (GCEP) for the telecommunication operators. We investigate the polynomial equivalence between the GCEP problem and the constrained shortest path problem (CSP) and present a pseudopolynomial algorithm for the GCEP problem, no matter the graph is acyclic or not. Furthermore, we investigate two special versions of the GCEP problem. F...

We address robust path planning for a mobile agent in a general environment by nding minimum cost source-destination paths having prescribed widths. The main result is a new approach which optimally solves the robust path planning problem using an e cient network ow formulation. Our algorithm represents a signi cant departure from conventional shortest-path or graph search based methods; it not...

We address robust path planning for a mobile agent in a general environment by finding minimum cost source-destination paths having prescribed widths. The main result is a new approach that optimally solves the robust path planning problem using an efficient network flow formulation. Our algorithm represents a significant departure from conventional shortest-path or graph search based methods; ...

An approach for the semi-automatic extraction of roads from high-resolution satellite imagery is proposed. Scale space, Edge-detection techniques are used as pre-processing for segmentation and estimation of road width. The detection of road is based on the cost minimization technique. The cost is estimated by taking various factors into consideration like variance, direction, length and width ...

this study was carried out in zarabd, bardsir and sirjan in kerman province in 2002-2003. a number of 58 green-house owners, five wholesaller and 20 retalisaller selected by systemathic sampling method. the results showed that cost marketing service was from 196 to 620 rials and marketing net benefit was 375 rials for cucumber and 230 rials for tomato. retail marketing net benefit was 204 rials...

The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is very responsive to topological and link-cost changes; however, except under light traffic loads, the delays obtained with this type of routing are far from optimal. Furthermore, if link costs are associated with delays, ...

We study the geometric shortest path and the minimum spanning tree problem with neighborhoods in the L1 metric. In this setting, we are given a graph G = (R, E), where R = {R1, . . . , Rn} is a set of polygonal regions in the plane. Placing a point pi inside each region Ri turns G into an edge-weighted graph Gp, p = {p1, . . . , pn}, where the cost of an edge is the distance between the points....

My proposed work is inspired by the experiment that uses expert judgment for estimation of the cost on the basis of previous project results. In this paper estimator can use Analogical strategies as well as Algorithmic Strategies as they wish. The proposed method is divided into two phases. First phase computed the probability of each selected factors by ant colony system. Second phase combines...

The Lee path connection algorithm is probably the most widely used method for finding wire paths on printed circuit boards. It is shown that the original claim of generality for the path cost function is incorrect, and a restriction, called the pathconsistency property, is introduced. The Lee algorithm holds for those path cost functions having this property. Codings for the cells of the grid a...

RMIT University Melbourne, BOX 2476V, VIC 3001, Australia, fkist,[email protected] Abstract This paper considers a directed graph G(N;A) with n nodes, m directed arcs and a cost value for each arc. The synthesis of a partially link disjoint pair of paths for a given OD-pair with the minimum total cost is investigated. An algorithm is presented that solves the all-best partially disjoint...