A new discrete filled function algorithm for discrete global optimization
DOI10.1016/J.CAM.2006.02.032zbMATH Open1115.65068OpenAlexW2119116495MaRDI QIDQ875372FDOQ875372
Authors: Yumei Liang, Yongjian Yang
Publication date: 13 April 2007
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2006.02.032
Recommendations
- Discrete global optimization problems with a modified discrete filled function
- Modified filled function method for global discrete optimization
- Discrete filled function method for discrete global optimization
- A new filled function method for global optimization
- New definition of filled function applied to global optimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Integer programming (90C10)
Cites Work
Cited In (16)
- A Class of Parameter-Free Filled Functions for Unconstrained Global Optimization
- 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
- Inflection point-based auxiliary function algorithm for finding global minima of coercive functions
- A discrete filled function algorithm for approximate global solutions of max-cut problems
- Discrete filled function method for discrete global optimization
- Towards global solutions of optimal discrete-valued control problems
- Analytical discrete optimization
- Discrete global optimization problems with a modified discrete filled function
- Parameter-free filled function method for nonlinear integer program
- Optimal Control of Switched System with Time Delay Detection of Switching Signal
- Filled function method to optimize supply chain transportation costs
- A non-parameter filled function method for unconstrained global optimization problems
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
- New tunnel-filled function method for discrete global optimization
This page was built for publication: A new discrete filled function algorithm for discrete global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875372)