.png){kind=icon}
Return
An approximate algorithm for nonlinear integer programming
.png){kind=icon}
PRE
AI
DOI：10.1016/S0096-3003(97)10083-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an approximate algorithm, which is modified from the Filled Function method for continuous global optimization, to solve nonlinear integer programming problems. Unlike the other approximate methods, the algorithm tries to improve a discrete local minimal solution by minimizing a filled function. It is a direct method. Numerical experiments show that this algorithm is efficient. (C) 1998 Elsevier Science Inc. All rights reserved.
Keywords:
nonlinear integer programming
filled function method
discrete local minimal solution
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
ShareSave no more
no more