A convex filled function method for nonlinear integer programming
From MaRDI portal
Publication:3073053
Recommendations
- A filled function method for constrained nonlinear integer programming
- scientific article; zbMATH DE number 5926315
- A new filled function method for nonlinear integer programming problem
- A filled function method for finding a global minimizer on global integer optimization
- scientific article; zbMATH DE number 7339455
Cited in
(10)- scientific article; zbMATH DE number 6875057 (Why is no real title available?)
- scientific article; zbMATH DE number 7339455 (Why is no real title available?)
- A filled function method for finding a global minimizer on global integer optimization
- One-parameter quasi-filled function algorithm for nonlinear integer programming
- scientific article; zbMATH DE number 5926315 (Why is no real title available?)
- A filled function method for constrained nonlinear integer programming
- A new filled function method for nonlinear integer programming problem
- A filled function method for box constrained nonlinear integer programming
- Two-parameters quasi-filled function algorithm for nonlinear integer programming
- scientific article; zbMATH DE number 6908174 (Why is no real title available?)
This page was built for publication: A convex filled function method for nonlinear integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073053)