A filled function method for finding a global minimizer on global integer optimization (Q557731)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2183999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A filled function method for finding a global minimizer on global integer optimization |
scientific article; zbMATH DE number 2183999 |
Statements
A filled function method for finding a global minimizer on global integer optimization (English)
0 references
30 June 2005
0 references
The authors present an algorithm for solving a nonlinear integer programming problem. This algorithm is based on a filled function introduced by the authors in this paper, obtained by modifying the global convexized filled function for continuous global optimization. Some numerical experiments and conclusions are given.
0 references
integer programming
0 references
local minimizer
0 references
global minimizer
0 references
filled function
0 references
global optimization
0 references
nonlinear integer programming
0 references
numerical experiments
0 references
0 references
0 references
0.9373526573181152
0 references
0.9191474318504332
0 references
0.9152453541755676
0 references
