A Heuristic Search Procedure for Estimating a Global Solution of Nonconvex Programming Problems
From MaRDI portal
Publication:4766811
DOI10.1287/opre.21.6.1267zbMath0281.90067OpenAlexW2102025359MaRDI QIDQ4766811
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.6.1267
Related Items
Accelerated random search for constrained global optimization assisted by radial basis function surrogates ⋮ A new QPSO based hybrid algorithm for constrained optimization problems via tournamenting process ⋮ Computational algorithms based on random search for solving global optimization problems ⋮ Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions ⋮ A self-organizing migrating genetic algorithm for constrained optimization ⋮ Greed is good: Heuristic adaptations for resilience in renewable resource management ⋮ Heuristische Lösungsverfahren Versuch einer Begriffsklärung ⋮ DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems ⋮ Solving constrained optimization problems using a novel genetic algorithm ⋮ On Non Overlapping Segmentation of the Response Surfaces for Solving Constrained Programming Problems Through Super Convergent Line Series