Share Your Research, Maximize Your Social Impacts
Performance evaluation of basic optimization methods for polynomial binary problems
Journal: Studia z Automatyki i Informatyki (Vol.41, No. -)Publication Date: 2016-12-01
Authors : Ignaczak Michal Dariusz Horla;
Page : 7-34
Keywords : binary polynomial problems; optimization; computational complexity;
Source : Download
Find it from : Google Scholar
Abstract
The paper considers performance issues of a class of iterative minimization methods of binary programs with polynomial functions. Problem structures that assure superior performance of a specific method have been stipulated with appropriate conclusions drawn.
Other Latest Articles
- PSO-based nonlinear predictive control for unmanned bicycle robot stabilization
- Statistical analysis of methods and measures used for irritating root canal
- Implementation of a deterministic video game agent testing environment
- Bode plot based stability analysis of a fractional-order PI controller with first-order time-delayed plant
- Comparison of particle filter and extended Kalman particle filter
Last modified: 2019-01-04 07:33:45