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 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 literat...
Saved in:
Main Authors: | Woon, Siew Fang, Rehbock, Volker, Loxton, Ryan |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/8951/1/A.pdf http://repo.uum.edu.my/8951/ http://science.cup.edu.cn/mathweb/icoca2012/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
by: Woon, Siew Fang, et al.
Published: (2010) -
Towards global solutions of optimal discrete-valued control problems
by: Woon, Siew Fang, et al.
Published: (2011) -
Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems
by: Woon, Siew Fang
Published: (2009) -
A variational discrete filled function approach in discrete global optimization
by: Woon, Siew Fang, et al.
Published: (2015) -
Global optimization method for continuous - Time sensor scheduling
by: Woon, Siew Fang, et al.
Published: (2010)