New filled function method for integer programming

Ming Ming Li; You Lin Shang; Lian Sheng Zhang

New filled function method for integer programming

Ming Ming Li^*
, You Lin Shang
, Lian Sheng Zhang

^*此作品的通讯作者

Shanghai University
Shanghai University of Engineering Science
Henan University of Science and Technology

科研成果: 期刊稿件 › 文章 › 同行评审

2 引用（Scopus）

摘要

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.

源语言	英语
页（从-至）	25-32
页数	8
期刊	Journal of Computational Mathematics
卷	24
期	1
出版状态	已出版 - 1月 2006
已对外发布	是

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{7108d46cb2104883a259d6cf2c22ceea,

title = "New filled function method for integer programming",

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 = "Filled function method, Global minimization, Integer programming",

author = "Li, \{Ming Ming\} and Shang, \{You Lin\} and Zhang, \{Lian Sheng\}",

year = "2006",

month = jan,

language = "English",

volume = "24",

pages = "25--32",

journal = "Journal of Computational Mathematics",

issn = "0254-9409",

publisher = "Global Science Press",

number = "1",

}

TY - JOUR

T1 - New filled function method for integer programming

AU - Li, Ming Ming

AU - Shang, You Lin

AU - Zhang, Lian Sheng

PY - 2006/1

Y1 - 2006/1

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

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.

KW - Filled function method

KW - Global minimization

KW - Integer programming

UR - https://www.scopus.com/pages/publications/33644653176

M3 - Article

AN - SCOPUS:33644653176

SN - 0254-9409

VL - 24

SP - 25

EP - 32

JO - Journal of Computational Mathematics

JF - Journal of Computational Mathematics

IS - 1

ER -

New filled function method for integer programming

摘要

其它文件与链接

学术指纹

引用此