Year: 2006
Author: Mingming Li, Youlin Shang, Liansheng Zhang
Journal of Computational Mathematics, Vol. 24 (2006), Iss. 1 : pp. 25–32
Abstract
The Filled Function Method is a class of effective algorithms for continuous global optimization. In this paper, a new filled function method is introduced and used to solve integer programming. Firstly, some basic definitions of discrete optimization are given. Then an algorithm and the implementation of this algorithm on several test problems are showed. The computational results show the algorithm is effective.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2006-JCM-8731
Journal of Computational Mathematics, Vol. 24 (2006), Iss. 1 : pp. 25–32
Published online: 2006-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 8
Keywords: Global minimization Integer programming Filled function method.