Identifying a global optimizer with filled function for nonlinear integer programming
From MaRDI portal
Publication:659491
DOI10.1155/2011/171697zbMATH Open1230.90135OpenAlexW2129556591WikidataQ58655421 ScholiaQ58655421MaRDI QIDQ659491FDOQ659491
Authors: Wei-Xiang Wang, Liansheng Zhang, Youlin 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
Recommendations
- A filled function method for finding a global minimizer on global integer optimization
- scientific article; zbMATH DE number 5926315
- A new filled function method for nonlinear integer programming problem
- scientific article; zbMATH DE number 2068701
- Modified Filled Function Method for Resolving Nonlinear Integer Programming Problem
Cites Work
- A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- A class of filled functions for finding global minimizers of a function of several variables
- Discrete filled function method for discrete global optimization
- 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
- Title not available (Why is that?)
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- Nonlinear integer programming for various forms of constraints
- Title not available (Why is that?)
- \(p\)th power Lagrangian method for integer programming
Cited In (2)
This page was built for publication: Identifying a global optimizer with filled function for nonlinear integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659491)
