A new discrete filled function algorithm for discrete global optimization

作者：

Highlights：

•

摘要

A definition of the discrete filled function is given in this paper. Based on the definition, a discrete filled function is proposed. Theoretical properties of the proposed discrete filled function are investigated, and an algorithm for discrete global optimization is developed from the new discrete filled function. The implementation of the algorithms on several test problems is reported with satisfactory numerical results.

论文关键词：Filled function method,Discrete global optimization,Nonlinear integer programming

论文评审过程：Received 1 March 2005, Revised 15 February 2006, Available online 25 October 2006.

论文官网地址：https://doi.org/10.1016/j.cam.2006.02.032