A filled function method for constrained nonlinear integer programming
From MaRDI portal
Recommendations
- A filled function method for box constrained nonlinear integer programming
- A new filled function method for nonlinear integer programming problem
- A filled function method for constrained global integer optimization
- A convex filled function method for nonlinear integer programming
- scientific article; zbMATH DE number 1558263
Cited in
(17)- scientific article; zbMATH DE number 6875057 (Why is no real title available?)
- scientific article; zbMATH DE number 7339455 (Why is no real title available?)
- An augmented filled function for global nonlinear integer optimization
- An auxiliary function method for global minimization in integer programming
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- scientific article; zbMATH DE number 1558263 (Why is no real title available?)
- scientific article; zbMATH DE number 5926315 (Why is no real title available?)
- A convex filled function method for nonlinear integer programming
- A continuous approach to nonlinear integer programming
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
- Parameter-free filled function method for nonlinear integer program
- A filled function method for constrained global integer optimization
- A new filled function method for nonlinear integer programming problem
- A filled function method for box constrained nonlinear integer programming
- Filled function method to optimize supply chain transportation costs
- A criterion for an approximation global optimal solution based on the filled functions
- scientific article; zbMATH DE number 6908174 (Why is no real title available?)
This page was built for publication: A filled function method for constrained nonlinear integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008807)