نتایج جستجو برای: non dominated vectors

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

2005
Yonina C. Eldar

We treat the class of sampling problems in which the underlying function can be specified by a finite set of samples. Our problem is to reconstruct the signal from non-ideal, noisy samples, which are modelled as the inner products of the signal with a set of sampling vectors, contaminated by noise. To mitigate the effect of the noise and the mismatch between the sampling and reconstruction vect...

Journal: :Fundam. Inform. 2008
Ashish Ghosh Mrinal Kanti Das

In this paper a new concept of ranking among the solutions of the same front, along with elite preservation mechanism and ensuring diversity through the nearest neighbor method is proposed for multi-objective genetic algorithms. This algorithm is applied on a set of benchmark multi-objective test problems and the results are compared with that of NSGA-II (a similar algorithm). The proposed algo...

Journal: :Russian Mathematical Surveys 2018

Journal: :journal of optimization in industrial engineering 2016
alireza eydi hiva farughi farid abdi

time, cost and quality are considered as the main components in managing each project. previous researches have mainly focused on the time-cost trade-off problems. recently quality is considered as the most important factor in project�s success, which is influenced by time acceleration that is the less time is spent the more success is gained. in time-cost-quality trade-off problems, each act...

2009
Michael Mazurek Slawomir Wesolkowski

....... The fast and elitist non-dominated sorting genetic algorithm (NSGA-II) contains a mechanism to sort individuals in a multi-objective optimization problem into non-dominated fronts, based on their performance in each optimization variable. When dealing with a bi-objective problem it is possible to carry-out the non-dominated sorting more efficiently, using the new sorting method presente...

Journal: :Games and Economic Behavior 2003
Massimo Morelli Maria Montero

The cooperative solution concept introduced here, the demand bargaining set, contains the core and is included in the Zhou bargaining set, eliminating the “dominated” coalition structures. The demand vectors belonging to the demand bargaining set are self-stable. In the class of constant-sum homogeneous weighted majority games the demand bargaining set is non-empty and predicts a unique demand ...

2001
Massimo Morelli Maria Montero Jean-Francois Mertens Anne van den Nouweland Alex Possajennikov Roberto Serrano Marco Slikker

The cooperative solution concept introduced here, the Stable Demand Set, contains the Core and is included in the Zhou Bargaining Set, eliminating the “dominated” coalition structures. The demand vectors belonging to the Stable Demand Set are self-stable. In the class of constant-sum homogeneous weighted majority games the Stable Demand Set is non-empty and predicts a unique stable demand vecto...

Journal: :Computers & OR 2009
Cristina Bazgan Hadrien Hugot Daniel Vanderpooten

In this paper, we present an approach, based on dynamic programming, for solving the 0-1 multi-objective knapsack problem. The main idea of the approach relies on the use of several complementary dominance relations to discard partial solutions that cannot lead to new non-dominated criterion vectors. This way, we obtain an efficient method that outperforms the existing methods both in terms of ...

Journal: :Bulletin of Electrical Engineering and Informatics 2016

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

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