Finding discrete global minima with a filled function for integer programming

You lin Shang; Lian sheng Zhang

doi:10.1016/j.ejor.2007.05.028

Finding discrete global minima with a filled function for integer programming

You lin Shang^*, Lian sheng Zhang

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

26 Citations (Scopus)

Abstract

The filled function method is an approach to find the global minimum of multidimensional functions. This paper proposes a new definition of the filled function for integer programming problem. A filled function which satisfies this definition is presented. Furthermore, we discuss the properties of the filled function and design a new filled function algorithm. Numerical experiments on several test problems with up to 50 integer variables have demonstrated the applicability and efficiency of the proposed method.

Original language	English
Pages (from-to)	31-40
Number of pages	10
Journal	European Journal of Operational Research
Volume	189
Issue number	1
DOIs	https://doi.org/10.1016/j.ejor.2007.05.028
Publication status	Published - 16 Aug 2008
Externally published	Yes

Keywords

Filled function
Global minimizer
Global optimization
Integer programming
Local minimizer

Access to Document

10.1016/j.ejor.2007.05.028

Cite this

@article{67908a27d29040f4a9bfccefaf65aa64,

title = "Finding discrete global minima with a filled function for integer programming",

abstract = "The filled function method is an approach to find the global minimum of multidimensional functions. This paper proposes a new definition of the filled function for integer programming problem. A filled function which satisfies this definition is presented. Furthermore, we discuss the properties of the filled function and design a new filled function algorithm. Numerical experiments on several test problems with up to 50 integer variables have demonstrated the applicability and efficiency of the proposed method.",

keywords = "Filled function, Global minimizer, Global optimization, Integer programming, Local minimizer",

author = "Shang, {You lin} and Zhang, {Lian sheng}",

year = "2008",

month = aug,

day = "16",

doi = "10.1016/j.ejor.2007.05.028",

language = "English",

volume = "189",

pages = "31--40",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Finding discrete global minima with a filled function for integer programming

AU - Shang, You lin

AU - Zhang, Lian sheng

PY - 2008/8/16

Y1 - 2008/8/16

N2 - The filled function method is an approach to find the global minimum of multidimensional functions. This paper proposes a new definition of the filled function for integer programming problem. A filled function which satisfies this definition is presented. Furthermore, we discuss the properties of the filled function and design a new filled function algorithm. Numerical experiments on several test problems with up to 50 integer variables have demonstrated the applicability and efficiency of the proposed method.

AB - The filled function method is an approach to find the global minimum of multidimensional functions. This paper proposes a new definition of the filled function for integer programming problem. A filled function which satisfies this definition is presented. Furthermore, we discuss the properties of the filled function and design a new filled function algorithm. Numerical experiments on several test problems with up to 50 integer variables have demonstrated the applicability and efficiency of the proposed method.

KW - Filled function

KW - Global minimizer

KW - Global optimization

KW - Integer programming

KW - Local minimizer

UR - http://www.scopus.com/inward/record.url?scp=38949092033&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2007.05.028

DO - 10.1016/j.ejor.2007.05.028

M3 - Article

AN - SCOPUS:38949092033

SN - 0377-2217

VL - 189

SP - 31

EP - 40

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

Finding discrete global minima with a filled function for integer programming

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this