Yüksek spektral verimlilik sağlamak gibi vaatleri olan 5G yeni nesil haberleşme teknolojisi için ortaya atılmış dikgen olmayan çoklu erişim (NOMA) tekniği son zamanlarda araştırmaların kilit noktası olmuştur. NOMA heterojen yapıya sahip olmasından dolayı yüksek veri hızı sağlayan çok-giriş çok-çıkış (MIMO) ile bütünleştirilmiştir. Elde edilen bu yapı sayesinde veriler daha az hatalı ve hızlı ol...

Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, min cut, min s-t cut, knapsack. Since most of these problems are NP -hard, we...

This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP -hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment problem is strongly NP -hard.

We present in this paper general pseudo-polynomial time algorithms to solve min-max and min-max regret versions of some polynomial or pseudo-polynomial problems under a constant number of scenarios. Using easily computable bounds, we can improve these algorithms. This way we provide pseudo-polynomial algorithms for the min-max and and min-max regret versions of several classical problems includ...

The following optimization problem is studied. There are several sets of integer positive numbers whose values are uncertain. The problem is to select one representative of each set such that the sum of the selected numbers is minimum. The uncertainty is modeled by discrete and interval scenarios, and the min–max and min–max (relative) regret approaches are used for making a selection decision....

In the literature, the solution set of a system of bipolar fuzzy relational equations with max-min composition can be characterized by a finite set of maximal and minimal solution pairs. However, some researches presented that determining the consistency of a system of bipolar fuzzy relational equations is NP-complete. Namely, the solution procedure for solving a system of bipolar fuzzy relatio...

We consider combinatorial optimization problems with uncertain objective functions. In the min-max-min robust optimization approach, a fixed number k of feasible solutions is computed such that the respective best of them is optimal in the worst case. The idea is to calculate a set of candidate solutions in a potentially expensive preprocessing and then select the best solution out of this set ...

Although linearly combining multiple variables can provide adequate diagnostic performance, certain algorithms have the limitation of being computationally demanding when number is sufficiently high. Liu et al. proposed min–max approach that combines minimum and maximum values biomarkers, which tractable has been shown to be optimal in scenarios. We developed Min–Max–Median/IQR algorithm under ...

We introduce a new numerical abstract domain able to infer min and max invariants over the program variables, based on max-plus polyhedra. Our abstraction is more precise than octagons, and allows to express non-convex properties without any disjunctive representations. We have defined sound abstract operators, evaluated their complexity, and implemented them in a static analyzer. It is able to...