نتایج جستجو برای: minimum cost path

تعداد نتایج: 663436  

Journal: :international journal of optimaization in civil engineering 0
e. hemat m.v.n. sivakumar

critical path method (cpm) is one of the most popular techniques used by construction practitioners for construction project scheduling since the 1950s. despite its popularity, cpm has a major shortcoming, as it is schedule based on two impractical acceptance that the project deadline is not bounded and that resources are unlimited. the analytical competency and computing capability of cpm thus...

2005
Shridhar Mubaraq Mishra

In this project we investigate the problem of channel allocation to a set of users in a centralized Cognitive Radio System. We consider three possible formulations of the problem and explain the relationship of these constraints to physical limiting factors. In the first formulation, we aim to minimize total power used in the system while fulfilling user rate requirements. This problem can be s...

2006
Evdokia Nikolova Matthew Brand David R. Karger

We present new complexity results and efficient algorithms for optimal route planning in the presence of uncertainty. We employ a decision theoretic framework for defining the optimal route: for a given source S and destination T in the graph, we seek an ST -path of lowest expected cost where the edge travel times are random variables and the cost is a nonlinear function of total travel time. A...

Journal: :رادار 0
سمانه پاک نیت حبیب اله عبیری هومن بهمن سلطانی

in this paper, the operation of helix traveling wave tube in interaction region is investigated by using a three dimensional large signal lagrangian model in frequency domain. the complete simulation of these tubes is essential for optimum design and minimum manufacturing cost. this 3d code can compute interception current (or current losses ), beam radius changes in interaction region and the ...

Journal: :Journal of Combinatorial Optimization 2008

Journal: :SIAM Journal on Optimization 2009
Ranga Muhandiramge Natashia Boland Song Wang

In many path planning situations we would like to find a path of constrained Euclidean length in R2 that minimises a line integral. We call this the Continuous Length-Constrained Minimum Cost Path Problem (C-LCMCPP). Generally, this will be a non-convex optimization problem, for which continuous approaches only ensure locally optimal solutions. However, network discretisations yield weight cons...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید