نتایج جستجو برای: starting problem
تعداد نتایج: 972665 فیلتر نتایج به سال:
In this work we solve completely the starting and stopping problem when the dynamics of the system are a general adapted stochastic process. We use backward stochastic differential equations and Snell envelopes. Finally we give some numerical results. AMS Classification subjects: 60G40 ; 93E20 ; 62P20 ; 91B99.
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
Interconnected power system networks are multi loop structured. Settings determination of all over current and distance relays in such networks can be in different forms and complicated. The main problem is the determination of starting points i.e. the location of starting relays in the procedure for settings, which is referred to as break points. In this paper, a new approach based on graph th...
this study aims to deal with a more realistic combined problem of project scheduling and material ordering. the goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. the problem is first mathematically modelled. then a hybrid simulated annealing and genetic algorithm is...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید