A hybrid genetic algorithm for integer programming and its convergence
From MaRDI portal
Recommendations
- A hybrid genetic algorithm with Boltzmann convergence properties
- scientific article; zbMATH DE number 1874282
- Genetic algorithms: Bridging the convergence gap
- Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
- A hybrid approach to resolving a differentiable integer program.
Cited in
(12)- Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems
- Solving irregular econometric and mathematical optimization problems with a genetic hybrid algorithm
- A hybrid approach to resolving a differentiable integer program.
- Towards merging binary integer programming techniques with genetic algorithms
- Genetic algorithms for solving a class of constrained nonlinear integer programs
- scientific article; zbMATH DE number 6672492 (Why is no real title available?)
- A Hybrid Genetic Algorithm for Two Types of Polygonal Approximation Problems
- scientific article; zbMATH DE number 1553358 (Why is no real title available?)
- A comparison of genetic and conventional methods for the solution of integer goal programmes
- Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints.
- Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
- A hybrid genetic algorithm with Boltzmann convergence properties
This page was built for publication: A hybrid genetic algorithm for integer programming and its convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3571699)
