Hybrid Enhanced Binary Honey Badger Algorithm with Quadratic Programming for Cardinality Constrained Portfolio Optimization
DOI10.1142/s0129054122420151zbMath1529.91065OpenAlexW4293568616WikidataQ114073262 ScholiaQ114073262MaRDI QIDQ6169946
No author found.
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054122420151
quadratic programmingmetaheuristicsportfolio optimizationcardinality constrained portfolio selectionbinary honey badger algorithm
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Portfolio theory (91G10)
Cites Work
- Asymptotic Laplacian-energy-like invariant of lattices
- Portfolio selection using neural networks
- Particle swarm optimization approach to portfolio optimization
- Heuristics for cardinality constrained portfolio optimization
- A local relaxation method for the cardinality constrained portfolio optimization problem
- On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks
- Solving cardinality constrained mean-variance portfolio problems via MILP
- Honey badger algorithm: new metaheuristic algorithm for solving optimization problems
- Optimal Cardinality Constrained Portfolio Selection
- THE HOSOYA INDEX OF GRAPHS FORMED BY A FRACTAL GRAPH
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
- Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization
This page was built for publication: Hybrid Enhanced Binary Honey Badger Algorithm with Quadratic Programming for Cardinality Constrained Portfolio Optimization
