Identifying a global optimizer with filled function for nonlinear integer programming
From MaRDI portal
Publication:659491
DOI10.1155/2011/171697zbMath1230.90135WikidataQ58655421 ScholiaQ58655421MaRDI QIDQ659491
Wei-Xiang Wang, Lian-Sheng Zhang, You-lin Shang
Publication date: 23 January 2012
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2011/171697
Cites Work
- Unnamed Item
- Unnamed Item
- A filled function method for finding a global minimizer on global integer optimization
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- A class of filled functions for finding global minimizers of a function of several variables
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
- Discrete filled function method for discrete global optimization
- Nonlinear integer programming for various forms of constraints
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- \(p\)th power Lagrangian method for integer programming