Genetic Algorithms for Solving a Class of Constrained Nonlinear Integer Programs

DOI10.1111/1475-3995.00006zbMath0992.90069OpenAlexW2026858138MaRDI QIDQ2767726

Ruhul A. Sarker, Thomas Philip Runarsson, Charles S. Newton

Publication date: 22 September 2002

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1475-3995.00006

zbMATH Keywords

genetic algorithmspenalty functionsconstrained nonlinear integer programsmanufacturing batch-sizing problemsmultiple raw materials

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Hierarchical maximal-coverage location-allocation: case of generalized search-and-rescue ⋮ Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming

This page was built for publication: Genetic Algorithms for Solving a Class of Constrained Nonlinear Integer Programs