نتایج جستجو برای: combinatorial optimization
تعداد نتایج: 351834 فیلتر نتایج به سال:
A classical problem of digital sequence design, first studied in the 1950s but still not well understood, is to determine those binary sequences whose aperiodic autocorrelations are collectively small according to some suitable measure. The merit factor is an important such measure, and the problem of determining the best value of the merit factor of long binary sequences has resisted decades o...
In this paper a general approach to combinatorial optimization problems with fuzzy weights is discussed. The results, valid for the interval-valued problems, are extended to the fuzzy-valued ones by exploiting the very recent notion of a gradual number. Some methods for determining the exact degrees of possible and necessary optimality and the possibility distributions of deviations of solution...
the multivariate exponentially weighted moving average (mewma) control chart is one of the best statistical control chart that are usually used to detect simultaneous small deviations on the mean of more than one cross-correlated quality characteristics. the economic design of mewma control charts involves solving a combinatorial optimization model that is composed of a nonlinear cost function ...
Robust combinatorial optimization problems with cardinality constrained uncertainty may be solved by a finite number of nominal problems. In this paper, we show that the number of nominal problems to be solved can be reduced significantly.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید