Metaheuristic downhill simplex method in combinatorial optimization
From MaRDI portal
Recommendations
Cites work
Cited in
(8)- Methods of constructing argument of objective function in combinatorial optimization problems
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- The blocking meta-heuristics for combinatorial problems solving
- Continuous representations and functional extensions in combinatorial optimization
- The concept of modeling packing and covering problems using modern computational geometry software
- Solving a multi-objective optimization problem on combinatorial point configurations
- Classification of applied methods of combinatorial optimization
- Convergence of a modified algorithm of fast probabilistic modeling
This page was built for publication: Metaheuristic downhill simplex method in combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941194)