Optimization of cardinality constrained portfolios with a hybrid local search algorithm
✍ Scribed by Dietmar Maringer; Hans Kellerer
- Publisher
- Springer
- Year
- 2003
- Tongue
- German
- Weight
- 300 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0171-6468
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract A genetic programming‐based geometry optimization method for inverse scattering that uses a tree data structure to encode Boolean combinations of convex shapes has recently been shown to outperform other genetic algorithm‐based techniques. Nonetheless, the genetic algorithms are still i
## Abstract Heuristic methods, such as tabu search, are efficient for global optimizations. Most studies, however, have focused on constraint‐free optimizations. Penalty functions are commonly used to deal with constraints for global optimization algorithms in dealing with constraints. This is some