Results 21 to 30 of about 11,854,671 (316)

On the equivalence of optimal recommendation sets and myopically optimal query sets

open access: yesArtificial Intelligence, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Viappiani, Paolo, Boutilier, Craig
openaire   +4 more sources

Multi-Guide Set-Based Particle Swarm Optimization for Multi-Objective Portfolio Optimization

open access: yesAlgorithms, 2023
Portfolio optimization is a multi-objective optimization problem (MOOP) with risk and profit, or some form of the two, as competing objectives. Single-objective portfolio optimization requires a trade-off coefficient to be specified in order to balance ...
Kyle Erwin, Andries Engelbrecht
doaj   +1 more source

The stability of minimal solution sets for set optimization problems via improvement sets

open access: yesJournal of Inequalities and Applications, 2023
In this paper we investigate the stability of solution sets for set optimization problems via improvement sets. Some sufficient conditions for the upper semicontinuity, lower semicontinuity, and compactness of E-minimal solution mappings are given for ...
Taiyong Li, Yanhui Wei
doaj   +1 more source

Scalarization and convergence in unified set optimization

open access: yesRAIRO Oper. Res., 2021
This paper deals with scalarization and stability aspects for a unified set optimization problem. We provide characterizations for a unified preference relation and the corresponding  unified minimal solution in terms of a generalized oriented distance ...
Khushboo Rai, P. Lalitha
semanticscholar   +1 more source

Set-valued optimization problems via second-order contingent epiderivative [PDF]

open access: yesYugoslav Journal of Operations Research, 2021
In this paper, we establish second-order KKT conditions of a set-valued optimization problem and study second-order Mond-Weir, Wolfe, and mixed types duals with the help of second-order contingent epiderivative and second-order generalized cone convexity
Das Koushik, Nahak Chandal
doaj   +1 more source

Chemical Reaction Optimization for Minimum Weight Dominating Set

open access: yesApplied Computational Intelligence and Soft Computing, 2023
Dominating set of a graph can be defined as the set of vertices that can cover all other vertices of the graph. The minimum weight dominating set (MWDS) is the minimum number of vertices in the dominating set with minimum total weight.
A. Pritam Khan Boni   +1 more
doaj   +1 more source

Large Independent Sets on Random d-Regular Graphs with Fixed Degree d

open access: yesComputation, 2023
The maximum independent set problem is a classic and fundamental combinatorial challenge, where the objective is to find the largest subset of vertices in a graph such that no two vertices are adjacent.
Raffaele Marino, Scott Kirkpatrick
doaj   +1 more source

An algorithmic multiple attribute decision-making method for heart problem analysis under neutrosophic hypersoft expert set with fuzzy parameterized degree-based setting [PDF]

open access: yesPeerJ Computer Science, 2023
A fuzzy parameterized neutrosophic hypersoft expert set (FpNHse-set) is one of the family members of fuzzy parameterized structures and a valuable extension of the neutrosophic soft expert set as well as the neutrosophic hypersoft set.
Muhammad Ihsan   +3 more
doaj   +2 more sources

Lagrange Duality in Set Optimization [PDF]

open access: yesJournal of Optimization Theory and Applications, 2013
Based on the complete-lattice approach, a new Lagrangian duality theory for set-valued optimization problems is presented. In contrast to previous approaches, set-valued versions for the known scalar formulas involving infimum and supremum are obtained. In particular, a strong duality theorem, which includes the existence of the dual solution, is given
Andreas H. Hamel, Andreas Löhne
openaire   +3 more sources

Multistage Adaptive Robust Binary Optimization: Uncertainty Set Lifting versus Partitioning through Breakpoints Optimization

open access: yesMathematics, 2023
Two methods for multistage adaptive robust binary optimization are investigated in this work. These methods referred to as binary decision rule and finite adaptability inherently share similarities in dividing the uncertainty set into subsets.
Farough Motamed Nasab, Zukui Li
doaj   +1 more source

Home - About - Disclaimer - Privacy