Mixed Tabu machine for portfolio optimization problem
From MaRDI portal
(Redirected from Publication:4976309)
Recommendations
- Linear and mixed integer programming for portfolio optimization
- scientific article; zbMATH DE number 2209656
- A computational intelligence method for solving a class of portfolio optimization problems
- Multi-objective stochastic programming for portfolio selection
- Metaheuristics for the portfolio selection problem
- Portfolio approaches for constraint optimization problems
- A hybrid algorithm based on genetic algorithm and tabu search to solve portfolio problem
- A hybrid intelligent algorithm for optimal birandom portfolio selection problems
- Hybrid metaheuristics for constrained portfolio selection problems
- Portfolio selection using multistage stochastic programming
Cites work
- Heuristic algorithms for the cardinality constrained efficient frontier
- Heuristics for cardinality constrained portfolio optimization
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- Linear and nonlinear programming.
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- On problem solving with Hopfield neural networks
- On the performance of the LP-guided Hopfield network-genetic algorithm
- On the stability of the travelling salesman problem algorithm of Hopfield and Tank
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Particle swarm optimization approach to portfolio optimization
- Portfolio selection using neural networks
- Quadratic programming and affine variational inequalities. A qualitative study.
- Tabu machine: A new neural network solution approach for combinatorial optimization problems
Cited in
(1)
This page was built for publication: Mixed Tabu machine for portfolio optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976309)