|
|||||
|
|
A NEW FILLED FUNCTION METHOD FOR INTEGER PROGRAMMING |
|
| Authors: | Ming-ming;Li;You-lin;Shang;Lian-sheng;Zhang |
| 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 |
| 本文献已被 CNKI 维普 等数据库收录！ | |
| 点击此处可从《计算数学(英文版)》浏览原始摘要信息 | |