نتایج جستجو برای: compromise programming
تعداد نتایج: 353087 فیلتر نتایج به سال:
We propose three mechanisms to reach compromise between two opposing parties. They are based on the use of Rules k Names, whereby one parties proposes a shortlist and other chooses from it. Methods this class used in practice appoint Supreme Court justices have been recently proposed for arbitration selection processes. Those we suggest flexible allow participate endogenous determination role p...
We study a concept in multicriteria optimization called compromise solutions (introduced in 1973 by Yu [20]) and a generalized version of this, termed reference point solutions. Our main result shows the power of this concept: Approximating reference point solutions is polynomially equivalent to constructing an approximate Pareto set as in [16]. A reference point solution is the solution closes...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید