full
search.png

Search

close.png

Cancel

arrow
Volume 24, Issue 1
A New Filled Function Method for Integer Programming

Mingming Li, Youlin Shang & Liansheng Zhang

J. Comp. Math., 24 (2006), pp. 25-32.

Published online: 2006-02

Preview Full PDF 2919 25692

Cited by

google scholar semantic scholar
Export citation
  • 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.

  • Keywords

Global minimization, Integer programming, Filled function method.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-24-25, author = {Li , MingmingShang , Youlin and Zhang , Liansheng}, title = {A New Filled Function Method for Integer Programming}, journal = {Journal of Computational Mathematics}, year = {2006}, volume = {24}, number = {1}, pages = {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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/8731.html} }
TY - JOUR T1 - A New Filled Function Method for Integer Programming AU - Li , Mingming AU - Shang , Youlin AU - Zhang , Liansheng JO - Journal of Computational Mathematics VL - 1 SP - 25 EP - 32 PY - 2006 DA - 2006/02 SN - 24 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/8731.html KW - Global minimization, Integer programming, Filled function method. AB -

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.

Li , MingmingShang , Youlin and Zhang , Liansheng. (2006). A New Filled Function Method for Integer Programming. Journal of Computational Mathematics. 24 (1). 25-32. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard