Discrete global optimization problems with a modified discrete filled function
From MaRDI portal
Publication:888308
DOI10.1007/s40305-015-0085-zzbMath1327.90122OpenAlexW1173534829MaRDI QIDQ888308
Meng-Li He, Yuelin Gao, Yong-jian Yang
Publication date: 30 October 2015
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-015-0085-z
Related Items (3)
Filled function method to optimize supply chain transportation costs ⋮ New tunnel-filled function method for discrete global optimization ⋮ Parameter-free filled function method for nonlinear integer program
Cites Work
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- A novel filled function method and quasi-filled function method for global optimization
- A new discrete filled function algorithm for discrete global optimization
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- A filled function method for finding a global minimizer of a function of several variables
- Dynamic globally concavized filled function method for continuous global optimization
- 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 new filled function applied to global optimization.
- New classes of globally convexized filled functions for global optimization
- A continuous approach to nonlinear integer programming
- A computable filled function used for global minimization
- A new discrete filled function method for finding global minimizer of the integer programming
- Finding discrete global minima with a filled function for integer programming
- Discrete filled function method for discrete global optimization
- A new filled function method for nonlinear integer programming problem
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A gradually descent method for discrete global optimization
- Globally concavized filled function method for the box constrained continuous global minimization problem
- An approximate algorithm for nonlinear integer programming
- A new filled function method for unconstrained global optimization
- Finding global minima with a computable filled function.
- Filled functions for unconstrained global optimization.
- Unnamed Item
This page was built for publication: Discrete global optimization problems with a modified discrete filled function
