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...

Full description

Bibliographic Details

Main Authors:	Woon, Siew Fang, Rehbock, Volker, Loxton, Ryan
Format:	Conference or Workshop Item
Language:	en
Published:	2012
Subjects:	QA Mathematics
Online Access:	https://repo.uum.edu.my/id/eprint/8951/1/A.pdf https://repo.uum.edu.my/id/eprint/8951/ http://science.cup.edu.cn/mathweb/icoca2012/
Tags:	Add Tag No Tags, Be the first to tag this record!