Discrete global optimization problems with a modified discrete filled function
type: Item
instance of: scholarly article
title: Discrete global optimization problems with a modified discrete filled function
zbMATH Open document ID: 1327.90122
author: Meng-Li He
author: Yuelin Gao
author: Yongjian Yang
published in: Journal of the Operations Research Society of China
publication date: 2015-10-30T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6502464
zbMATH Keywords: filled function method
zbMATH Keywords: discrete global optimization
zbMATH Keywords: nonlinear integer programming
MaRDI profile type: Publication
full work available at URL: s40305-015-0085-z
OpenAlex ID: W1173534829
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming
cites work: A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
cites work: An approximate algorithm for nonlinear integer programming
cites work: Q4719183
cites work: Discrete global descent method for discrete global optimization and nonlinear integer programming
cites work: A new discrete filled function algorithm for discrete global optimization
cites work: A class of filled functions for finding global minimizers of a function of several variables
cites work: A filled function method for finding a global minimizer of a function of several variables
cites work: Finding global minima with a computable filled function.
cites work: Filled functions for unconstrained global optimization.
cites work: New classes of globally convexized filled functions for global optimization
cites work: A computable filled function used for global minimization
cites work: A new filled function applied to global optimization.
cites work: A novel filled function method and quasi-filled function method for global optimization
cites work: A continuous approach to nonlinear integer programming
cites work: Discrete filled function method for discrete global optimization
cites work: A new filled function method for nonlinear integer programming problem
cites work: A gradually descent method for discrete global optimization
cites work: Finding discrete global minima with a filled function for integer programming
cites work: Globally concavized filled function method for the box constrained continuous global minimization problem
cites work: A new filled function method for unconstrained global optimization
cites work: Dynamic globally concavized filled function method for continuous global optimization
cites work: A new discrete filled function method for finding global minimizer of the integer programming
cites work: A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
DOI: 10.1007/S40305-015-0085-Z
description: scientific article; zbMATH DE number 6502464