A modified discrete filled function algorithm for solving nonlinear discrete optimization problems
The discrete filled function method is a global optimization tool for searching for the best solution amongst multiple local optima. This method has proven useful for solving large-scale discrete optimization problems. In this paper, we consider a standard discrete filled function algorithm in the l...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
COC Publications, Curtin University
2012
|
| Online Access: | http://hdl.handle.net/20.500.11937/11073 |