A simplex grey wolf optimizer for solving integer programming and minimax problems

DOI10.3934/naco.2017020zbMath1370.90149OpenAlexW2748049589MaRDI QIDQ2402871

Yanyan Li

Publication date: 15 September 2017

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2017020

zbMATH Keywords

minimax problemsinteger programming problemsgrey wolf optimizersimplex Nelder-Mead method

Mathematics Subject Classification ID

Integer programming (90C10) Minimax problems in mathematical programming (90C47) Derivative-free methods and methods using generalized derivatives (90C56) Randomized algorithms (68W20)

Related Items

Solving nonlinear systems and unconstrained optimization problems by hybridizing whale optimization algorithm and flower pollination algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms with adaptive smoothing for finite minimax problems
• An improved branch and bound algorithm for mixed integer nonlinear programs
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Biomimicry of social foraging bacteria for distributed optimization: Models, principles, and emergent behaviors
• Minimax and applications
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• Memetic particle swarm optimization
• Nonlinear programming using minimax techniques
• Solving minimax problems by interval methods
• A New Metaheuristic Bat-Inspired Algorithm
• A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
• Branch-and-Bound Methods: A Survey
• A Simplex Method for Function Minimization
• Smoothing method for minimax problems