Equitable Optimization for Multicast Communication

Fourour, Said; Lebbah, Yahia

doi:10.4018/ijdsst.2020070101

Cited by 3 publications

(1 citation statement)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this sense, the system weights the introduced values in relation to a given order, thereby measuring the importance of the introduced values with independence to the origin of the information [46]. This characteristic design has been widely applied in automation control systems [47], computer science and information systems [48], and telecommunications [49] among a wide variety of applications. The increasing appeal of the OWA operators' design can be observed in wide ranging reviews such as [17].…”

Section: Ordered Weighted Average Operatormentioning

confidence: 99%

Variances and Logarithmic Aggregation Operators: Extended Tools for Decision-Making Processes

et al. 2021

View full text Add to dashboard Cite

Variance, as a measurement of dispersion, is a basic component of decision-making processes. Recent advances in intelligent systems have included the concept of variance in information fusion techniques for decision-making under uncertainty. These dispersion measures broaden the spectrum of decision makers by extending the toolset for the analysis and modeling of problems. This paper introduces some variance logarithmic averaging operators, including the variance generalized ordered weighted averaging (Var-GOWLA) operator and the induced variance generalized ordered weighted averaging (Var-IGOWLA) operator. Moreover, this paper analyzes some properties, families and particular cases of the proposed operators. Finally, an illustrative example of the characteristic design of the operators is proposed using real-world information retrieved from financial markets. The objective of this paper is to analyze the performance of some equities based on the expected payoff and the dispersion of its elements. Results show that the equity payoff results present diverse rankings combined with the proposed operators, and the introduced variance measures aid decision-making by offering new tools for information analysis. These results are particularly interesting when selecting logarithmic averaging operators for decision-making processes. The approach presented in this paper extends the available tools for decision-making under ignorance, uncertainty, and subjective environments.

show abstract

Section: Ordered Weighted Average Operatormentioning

confidence: 99%

Variances and Logarithmic Aggregation Operators: Extended Tools for Decision-Making Processes

et al. 2021

View full text Add to dashboard Cite

show abstract

Constraint relaxation for the discrete ordered median problem

Martínez-Merino

Ponce

Puerto

2022

TOP

View full text Add to dashboard Cite

This paper compares different exact approaches to solve the Discrete Ordered Median Problem (DOMP). In recent years, DOMP has been formulated using set packing constraints giving rise to one of its most promising formulations. The use of this family of constraints, known as strong order constraints (SOC), has been validated in the literature by its theoretical properties and because their linear relaxation provides very good lower bounds. Furthermore, embedded in branch-and-cut or branch-price-and-cut procedures as valid inequalities, they allow one to improve computational aspects of solution methods such as CPU time and use of memory. In spite of that, the above mentioned formulations require to include another family of order constraints, e.g., the weak order constraints (WOC), which leads to coefficient matrices with elements other than {0,1}. In this work, we develop a new approach that does not consider extra families of order constraints and furthermore relaxes SOC -in a branch-and-cut procedure that does not start with a complete formulation- to add them iteratively using row generation techniques to certify feasibility and optimality. Exhaustive computational experiments show that it is advisable to use row generation techniques in order to only consider {0,1}-coefficient matrices modeling the DOMP. Moreover, we test how to exploit the problem structure. Implementing an efficient separation of SOC using callbacks improves the solution performance. This allows us to deal with bigger instances than using fixed cuts/constraints pools automatically added by the solver in the branch-and-cut for SOC, concerning both the formulation based on WOC and the row generation procedure.

show abstract