A filled function method for finding a global minimizer on global integer optimization

Authors:
You-lin Shang;Lian-sheng Zhang
Affiliations:
Department of Mathematics, Shanghai University, 99, Shang Da Road, Baoshan, Shanghai 200436, China and Department of Mathematics, Henan University of Science and Technology, Luoyang 471003, China;Department of Mathematics, Shanghai University, 99, Shang Da Road, Baoshan, Shanghai 200436, China
Venue:
Journal of Computational and Applied Mathematics
Year:
2005

Citing 9
Cited 3

A class of filled functions for finding global minimizers of several variables

Journal of Optimization Theory and Applications
A continuous approach to nonlinear integer programming

Applied Mathematics and Computation
A filled function method for finding a global minimizer of a function of several variables

Mathematical Programming: Series A and B
The globally convexized filled functions for global optimization

Applied Mathematics and Computation
An approximate algorithm for nonlinear integer programming

Applied Mathematics and Computation
Recent developments and trends in global optimization

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. IV: optimization and nonlinear equations
SPT: a stochastic tunneling algorithm for global optimization

Journal of Global Optimization
New Classes of Globally Convexized Filled Functions for Global Optimization

Journal of Global Optimization
A New Filled Function Method for Global Optimization

Journal of Global Optimization

A discrete filled function algorithm for approximate global solutions of max-cut problems

Journal of Computational and Applied Mathematics
A discrete dynamic convexized method for nonlinear integer programming

Journal of Computational and Applied Mathematics
Parallel algorithm of MCQoS routing based on improved PSRS and binary search

ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology

Quantified Score

Hi-index	7.29

Visualization

Abstract

The paper gives a definition of the filled function for nonlinear integer programming. This definition is modified from that of the global convexized filled function for continuous global optimization. A filled function with only one parameter which satisfies this definition is presented. We also discuss the properties of the proposed function and give a filled function method to solve the nonlinear integer programming problem. The implementation of the algorithm on several test problems is reported with satisfactory numerical results.