Identifying a global optimizer with filled function for nonlinear integer programming
From MaRDI portal
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
- scientific article; zbMATH DE number 1558263 (Why is no real title available?)
- scientific article; zbMATH DE number 5056297 (Why is no real title available?)
- A class of filled functions for finding global minimizers of a function of several variables
- A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
- A filled function method for finding a global minimizer on global integer optimization
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Discrete filled function method for discrete global optimization
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- Nonlinear integer programming for various forms of constraints
- \(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)
