نتایج جستجو برای: multi objective knapsack problem

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

Journal: :تحقیقات مالی 0
مهسا رجبی دانشجوی دکتری برق ـ کنترل و سیستم، دانشگاه صنعتی خواجه نصیرالدین طوسی، تهران، ایران حمید خالوزاده استاد دانشگاه صنعتی خواجه نصیرالدین طوسی، تهران، ایران

despite the growing use of evolutionary multi-objective optimization algorithms in different categories of science, these algorithms as a powerful tool in portfolio optimization and specially solving multi-objective portfolio optimization problem is still in its early stages. in this paper, moeas have been used for solving multi-objective portfolio optimization problem in tehran stock market. f...

2018
Yasushi Kawase Hanna Sumita Takuro Fukunaga

Weconsider themaximization problem of monotone submodular functions under an uncertain knapsack constraint. Specifically, the problem is discussed in the situation that the knapsack capacity is not given explicitly and can be accessed only through an oracle that answers whether or not the current solution is feasible when an item is added to the solution. Assuming that cancellation of the last ...

2007
Md. Waselul Haque Sadid Md. Rabiul Islam S. M. Kamrul Hasan

This paper presents a new heuristic algorithm for the MultipleChoice Multi-Dimension Knapsack Problem (MMKP) in PRAM model. MMKP is a variant of the classical 0-1 knapsack problem, has a knapsack with multidimensional capacity constraints, groups of items, each item having a utility value and multidimensional resource constraints. The problem is to maximize the total value of the items in the k...

Journal: :international journal of mathematical modelling and computations 0
ghasem tohidi department of mathematics, islamic azad university, central tehran branch, iran iran, islamic republic of shabnam razavyan

this paper uses the l1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (wdsnd) vectorsof a multi-objective mixed integer linear programming (momilp) problem.the proposed method generalizes the proposed approach by tohidi and razavyan[tohidi g., s. razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...

2006
Dimo Brockhoff Eckart Zitzler

The number of objectives in a multiobjective optimization problem strongly influences both the performance of generating methods and the decision making process in general. On the one hand, with more objectives, more incomparable solutions can arise, the number of which affects the generating method’s performance. On the other hand, the more objectives are involved the more complex is the choic...

Journal: :Theory of Computing 2012
Navin Goyal Luis Rademacher

Smoothed analysis of multiobjective 0–1 linear optimization has drawn considerable attention recently. In this literature, the number of Pareto-optimal solutions (i.e., solutions with the property that no other solution is at least as good in all the coordinates and better in at least one) for multiobjective optimization problems is the central object of study. In this paper, we prove several l...

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

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