نتایج جستجو برای: objective optimization
تعداد نتایج: 838672 فیلتر نتایج به سال:
Abstract In this paper we consider a problem, called convex projection, of projecting set onto subspace. We will show that to projection one can assign particular multi-objective optimization such the solution problem also solves (and vice versa), which is analogous result in polyhedral case considered Löhne and Weißing (Math Methods Oper Res 84(2):411–426, 2016). practice, however, only comput...
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...
Most of the derivative-free optimization (DFO) algorithms rely on a comparison function able to compare any pair of points with respect to a blackbox objective function. Recently, new dedicated derivative-free optimization algorithms have emerged to tackle multi-objective optimization problems and provide a Pareto front approximation to the user. This work aims at reusing single objective DFO a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید